The following pages link to Dietrich Braess (Q355118):
Displayed 50 items.
- Confluent Prony approximation (Q1192162) (← links)
- The Lanczos algorithm and Hankel matrix factorization (Q1194514) (← links)
- A Chebychev-Vandermonde solver (Q1194520) (← links)
- Procedural interpolation with curvature-continuous cubic splines (Q1195321) (← links)
- Interpolatory convexity-preserving subdivision schemes for curves and surfaces (Q1195324) (← links)
- An Arnoldi-based iterative scheme for nonsymmetric matrix pencils arising in finite element stability problems (Q1195466) (← links)
- Compact finite difference schemes with spectral-like resolution (Q1201687) (← links)
- Erratum to ``Confluent Prony approximation'' (Q1205897) (← links)
- On the numer of best approximations in certain non-linear families of functions (Q1216772) (← links)
- On uniqueness of \(L_1\)-approximation for certain families of spline functions (Q1218974) (← links)
- Anregungen aus dem Schnittebenenverfahren für die Lösung des allgemeinen Transportproblems (Q1219826) (← links)
- On the degree of approximation by spline functions with free knots (Q1226692) (← links)
- On rational \(L_2\)-Approximation (Q1229370) (← links)
- Über die Einzugsbereiche der Nullstellen von Polynomen beim Newton-Verfahren (Q1240523) (← links)
- Chebyshev approximation by \(\gamma\)-polynomials. III. On the number of best approximations (Q1254679) (← links)
- Fractal interpolation surfaces and a related 2-D multiresolution analysis (Q1260885) (← links)
- Multi-grid methods for steady state diffusion in random media (Q1261363) (← links)
- Parameter identification by continuation methods (Q1262089) (← links)
- Numerical solution of positive sum exponential equations (Q1262090) (← links)
- Accuracy of lattice translates of several multidimensional refinable functions (Q1268712) (← links)
- Approximation of unbounded functions by a new sequence of linear positive operators (Q1270695) (← links)
- On producing multiple solutions using repeated trials (Q1272987) (← links)
- An NP-hardness result for nonlinear systems (Q1276126) (← links)
- On Halley iteration (Q1282367) (← links)
- A cascadic multigrid algorithm for the Stokes equations (Q1294022) (← links)
- Fast QR factorization of low-rank changes of Vandermonde-like matrices (Q1294068) (← links)
- Convergence analysis of the two-stage multisplitting method (Q1300664) (← links)
- Stability of block LDL\(^T\) factorization of a symmetric tridiagonal matrix (Q1301300) (← links)
- A multigrid method for nonconforming FE-discretisations with application to non-matching grids (Q1304970) (← links)
- A class of equivalent enhanced assumed strain and hybrid stress finite elements (Q1305594) (← links)
- Condition-sensitive computation of approximate fixed points (Q1311391) (← links)
- Splines in motion---an introduction to MODUS and some unresolved approximation problems (Q1315182) (← links)
- An algorithm for determining the approximation orders of multivariate periodic spline spaces (Q1315186) (← links)
- A stability test for real polynomials (Q1326435) (← links)
- An adaptive Chebyshev iterative method for nonsymmetric linear systems based on modified moments (Q1326468) (← links)
- A generalized ADI iterative method (Q1326479) (← links)
- Behavior of alternation points in best rational approximation (Q1327435) (← links)
- Asymptotic expansions for classical and generalized divided differences including applications (Q1334233) (← links)
- Discrete linearized least-squares rational approximation on the unit circle (Q1334798) (← links)
- A new method for solving nonlinear underdetermined systems (Q1337997) (← links)
- Triangular skew-symmetric iterative solvers for strongly nonsymmetric positive real linear system of equations (Q1349136) (← links)
- On the convergence of the generalized AOR method (Q1355238) (← links)
- A note on the convergence of the Weierstrass SOR method for polynomial roots (Q1360163) (← links)
- A basic family of iteration functions for polynomial root finding and its characterizations (Q1360168) (← links)
- On nonlinear SOR-like methods. I: Applications to simultaneous methods for polynomial zeros (Q1365319) (← links)
- On nonlinear SOR-like methods. II: Convergence of the SOR-Newton method for mildly nonlinear equations (Q1365320) (← links)
- Computing the Newtonian graph (Q1368688) (← links)
- Matrix enlarging methods and their application (Q1371659) (← links)
- Solving sparse linear least-squares problems on some supercomputers by using large dense blocks (Q1371662) (← links)
- Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods (Q1371672) (← links)