The following pages link to (Q4342463):
Displaying 50 items.
- On the use of history variables (Q1145994) (← links)
- Computational methods of linear algebra (Q1148099) (← links)
- Iterative refinement for linear systems in variable-precision arithmetic (Q1150248) (← links)
- The numerical stability of evaluation schemes for polynomials based on the Lagrange interpolation form (Q1161027) (← links)
- A stable method for the evaluation of a polynomial and of a rational function of one variable (Q1166888) (← links)
- The Laguerre inequalities with applications to a problem associated with the Riemann hypothesis (Q1187058) (← links)
- Unconstrained and constrained global optimization of polynomial functions in one variable (Q1187372) (← links)
- On the stability of solution methods for band Toeplitz systems (Q1190111) (← links)
- Are the coefficients of a polynomial well-conditioned functions of its roots? (Q1203402) (← links)
- Error analysis of two algorithms for the computation of the matrix exponential (Q1207776) (← links)
- Méthode numérique de detection de la singularite d'une matrice (Q1216015) (← links)
- Test of pole-zero cancellation in estimated models (Q1221725) (← links)
- A survey of techniques in applied computational complexity (Q1224857) (← links)
- Convergence of Newton-like methods for solving systems of nonlinear equations (Q1228181) (← links)
- On the solution of the linear least squares problems and pseudo-inverses (Q1228331) (← links)
- Numerical stability for solving nonlinear equations (Q1230355) (← links)
- Numerical stability of the Chebyshev method for the solution of large linear systems (Q1231755) (← links)
- Über die Einzugsbereiche der Nullstellen von Polynomen beim Newton-Verfahren (Q1240523) (← links)
- Nonlinear finite element analysis of curved beams (Q1242032) (← links)
- Parallel direct linear system solvers - a survey (Q1242427) (← links)
- On computing the best least squares solutions in Hilbert space (Q1248897) (← links)
- Isotropic distributions of test matrices (Q1253874) (← links)
- Root squaring using level-index arithmetic (Q1263936) (← links)
- Experiments with data perturbations to study condition numbers and numerical stability (Q1308502) (← links)
- Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions (Q1310976) (← links)
- Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation (Q1311327) (← links)
- Entrywise perturbation theory and error analysis for Markov chains (Q1326397) (← links)
- Spectral portrait for non-Hermitian large sparse matrices (Q1340876) (← links)
- On summation formulas due to Plana, Lindelöf and Abel, and related Gauss-Christoffel rules. I (Q1359967) (← links)
- A general method to generate parallel iterations for finding all zeros of polynomial simultaneously (Q1387450) (← links)
- Remarks on the complexity of roundoff analysis (Q1393806) (← links)
- Étude statistique des erreurs dans l'ARITHM<ETIQUE DES ORDINATEURS, APPLICATIONS AU CONTR<OLE DES R<ESULTTS D'algorithmes numériques (Q1394088) (← links)
- On the condition of algebraic equations (Q1394089) (← links)
- A method for finding the zeros of polynomials using a companion matrix. (Q1421154) (← links)
- System theoretic based characterisation and computation of the least common multiple of a set of polynomials. (Q1430368) (← links)
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125) (← links)
- The solution of infinitely ill-conditioned weakly-singular problems (Q1585803) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- Efficient computation of tridiagonal matrices largest eigenvalue (Q1675958) (← links)
- On developing a stable and quadratic convergent method for solving absolute value equation (Q1676005) (← links)
- Accurate evaluation of Bézier curves and surfaces and the Bernstein-Fourier algorithm (Q1732167) (← links)
- Evaluation schemes in the ring of quaternionic polynomials (Q1742581) (← links)
- Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence (Q1760574) (← links)
- A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm (Q1819535) (← links)
- Rounding error analysis of Horner's scheme (Q1836266) (← links)
- Evaluation de l'incertitude sur la solution d'un système linéaire (Q1846731) (← links)
- Stability analysis of a general Toeplitz system solver (Q1904145) (← links)
- Modified Newton method in circular interval arithmetic (Q1904962) (← links)
- On the complexity of solving feasible systems of linear inequalities specified with approximate data (Q1919805) (← links)
- Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints (Q1921395) (← links)
