64,95 €
64,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
32 °P sammeln
64,95 €
64,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
32 °P sammeln
Als Download kaufen
64,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
32 °P sammeln
Jetzt verschenken
64,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
32 °P sammeln
  • Format: ePub

Featuring the C programming language to implement algorithms, this work provides a unique collection of linear approximation techniques that can be used to analyze, model, and compress discrete data in a variety of fields. It focuses on various L1, Chebyshev, and least squares approximations, including one-sided, bounded variables, and piecewise. The authors also present the solution of underdetermined systems of consistent linear equations that are subject to different constraints on the elements of the unknown solution vector. They compare numerical results of the algorithms, which are…mehr

  • Geräte: eReader
  • mit Kopierschutz
  • eBook Hilfe
  • Größe: 2.19MB
Produktbeschreibung
Featuring the C programming language to implement algorithms, this work provides a unique collection of linear approximation techniques that can be used to analyze, model, and compress discrete data in a variety of fields. It focuses on various L1, Chebyshev, and least squares approximations, including one-sided, bounded variables, and piecewise. The authors also present the solution of underdetermined systems of consistent linear equations that are subject to different constraints on the elements of the unknown solution vector. They compare numerical results of the algorithms, which are accompanied by solved examples, and include a CD-ROM with source code and test drivers.


Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Autorenporträt
Abdelmalek, Nabih; Malek, William A.