Über diskrete und lineare Tschebyscheff-Approximationen

From MaRDI portal
Revision as of 10:46, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:770591

DOI10.1007/BF01386369zbMath0083.11501MaRDI QIDQ770591

Eduard Stiefel

Publication date: 1959

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131415




Related Items (35)

Jordan-Elimination und Ausgleichung nach kleinsten QuadratenZur angenäherten ganzrationalen Tschebyscheff-Approximation mit Hilfe trigonometrischer InterpolationOn the Chebyshev solution of inconsistent linear equationsA primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraintsÜber Tschebyscheffsche Approximationen mit linearen NebenbedingungenÜber Extremalsignaturen linearer Polynome in n VeränderlichenEstimates for Some Computational Techniques in Linear AlgebraOn L1 and Chebyshev estimationNewton's method for convex programming and Tschebyscheff approximationThe historical development of the linear minimax absolute residual estimation procedure 1786--1960Computational methods of linear algebraChebyshev solution of overdetermined systems of linear equationsCombinatorial properties of support vectors of separating hyperplanesAn algorithm for form error evaluation - using the theory of discrete and linear Chebyshev approximationComputational Algorithms for Calculating Least Absolute Value and Chebyshev Estimates for Multiple RegressionComplexity and applications of the homotopy principle for uniformly constrained sparse minimizationDiscrete, linear approximation problems in polyhedral normsA dual method for discrete Chebychev curve fittingA New Algorithm for the Chebyshev Solution of Overdetermined Linear SystemsA linear programming procedure based on de la Vallée poussin's minimax estimation procedureDie Bedeutung der Normalität bei rationaler Tschebyscheff-ApproximationThéoremes de caractérisation d'une meilleure approximation dans un espace norme et généralisation de l'algorithme de RemesTschebyscheff-Approximation im Bereich der rationalen Funktionen bei Vorliegen einer guten AusgangsnäherungDie konstruktive Ermittlung der Tschebyscheff-Approximierenden im Bereich der rationalen FunktionenAn algorithm of successive minimization in convex programmingEin Pseudo-Gradientenverfahren zur Lösung des diskreten linearen Tschebyscheff-ProblemsČebyšev-Approximation stetiger Funktionen in zwei Veränderlichen. (Čebyšev-approximation of continuous fuctions of two variables)Die Konstruktion der Tschebyscheff-Approximierenden bei der Anpassung mit ExponentialsummenNote on Jordan elimination, linear programming and Tchebyscheff approximationDégénérescence dans les approximations de Tschebyscheff linéaires et discrètesÜber Tschebyscheffsche ApproximationenEin Konstruktionsverfahren bei allgemeiner linearer ApproximationConvergence de l'algorithme de RemesApproximation in normed linear spacesThe strict Chebyshev solution of overdetermined systems of linear equations with rank deficient matrix




Cites Work




This page was built for publication: Über diskrete und lineare Tschebyscheff-Approximationen