scientific article; zbMATH DE number 1024452

Publication date: 19 June 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Roundoff error (65G50) Numerical computation of solutions to single equations (65H05) Collected or selected works; reprintings or translations of classics (01A75) History of numerical analysis (65-03) Numerical linear algebra (65Fxx)

Related Items

Rundungsfehleranalyse einiger Verfahren zur Summation endlicher Summen ⋮ Mixed precision algorithms in numerical linear algebra ⋮ Computation of the GCD of polynomials using gaussian transformations and shifting ⋮ Pseudozeros of multivariate polynomials ⋮ Solving linear least squares problems by Gram-Schmidt orthogonalization ⋮ On the generalisation of Bairstow's method ⋮ An Infinite Family of Hadamard Matrices with Fourth Last Pivot n /2 ⋮ On the Chebyshev solution of inconsistent linear equations ⋮ Finding the roots of a non-linear equation: history and reliability ⋮ Rounding Proportions:Rules of Rounding ⋮ A statistical model of roundoff error for varying length floating-point arithmetic ⋮ Stabilité numérique de l'algorithme de Levinson ⋮ A Numerical Method for Locating the Zeros of an Analytic Function ⋮ Computations in the neighbourhood of algebraic singularities ⋮ Implementation of a low round-off summation method ⋮ Statistical concepts in computational mathematics ⋮ The Calculation of the Eigenvectors of a General Complex Matrix by Inverse Iteration ⋮ Floating-point arithmetic ⋮ Detection of bifurcations in noisy coupled systems from multiple time series ⋮ Round off error analysis for Gram-Schmidt method and solution of linear least squares problems ⋮ Rigorous Machine Bounds for the Eigensystem of a General Complex Matrix ⋮ Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning ⋮ Conditioning of linear systems arising from penalty methods ⋮ Parallel vectorized implementations of compensated summation algorithms ⋮ A class of prescribed Weingarten curvature equations for locally convex hypersurfaces with boundary in $\mathbb{R}^{n+1}$ ⋮ The errors of first and second kinds in welch-aspln's solution of the behrens-fisher problem ⋮ Five-Precision GMRES-Based Iterative Refinement ⋮ Rounding error analysis of linear recurrences using generating series ⋮ Eight Perspectives on the Exponentially Ill-Conditioned Equation $\varepsilon y - x y' + y = 0$ ⋮ An Algorithm for Certain Double Sums of Polynomial Series ⋮ Unnamed Item ⋮ Generalized Sensitivity Analysis of Nonlinear Programs ⋮ A root-finding algorithm based on Newton's method ⋮ Numerical stability of algorithms at extreme scale and low precisions ⋮ Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems ⋮ The Condition Number of Join Decompositions ⋮ A multidata method of approximate Laplace transform inversion ⋮ Unnamed Item ⋮ Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions ⋮ Compressible Fluid Flow and the Approximation of Iterated Integrals of a Singular Function ⋮ Rounding errors in solving block Hessenberg systems ⋮ Error Analysis of the Algorithm for Shifting the Zeros of a Polynomial by Synthetic Division ⋮ On factorization method ⋮ Problems of optimization and numerical stability in computations ⋮ Roundoff Error Analysis of the Fast Fourier Transform ⋮ Algebraic Error Analysis for Mixed-Precision Multigrid Solvers ⋮ An Efficient Variant of the GMRES(m) Method Based on the Error Equations ⋮ Mixed-precision iterative refinement using tensor cores on GPUs to accelerate solution of linear systems ⋮ Computing multiple roots of inexact polynomials ⋮ Unnamed Item ⋮ Numerical treatment of a class of semi‐infinite programming problems ⋮ Stable husbands ⋮ Performance and accuracy of hardware-oriented native-, emulated- and mixed-precision solvers in FEM simulations ⋮ Converting Approximate Error Bounds into Exact Ones ⋮ Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series ⋮ Accuracy of the Lanczos Process for the Eigenproblem and Solution of Equations ⋮ On the optimal stability of the Bernstein basis ⋮ A New Approach to Probabilistic Rounding Error Analysis ⋮ Computing Multiple Solutions of Topology Optimization Problems ⋮ Rounding errors in numerical solutions of two linear equations in two unknowns ⋮ Deflation Techniques for Finding Distinct Solutions of Nonlinear Partial Differential Equations ⋮ Towards an Implementation of a Computer Algebra System in a Functional Language ⋮ Algebraic Error Analysis for Mixed-Precision Multigrid Solvers ⋮ The Condition Number of Riemannian Approximation Problems ⋮ Stochastic Rounding and Its Probabilistic Backward Error Analysis ⋮ Deflation for semismooth equations ⋮ Complex-Valued Imaging with Total Variation Regularization: An Application to Full-Waveform Inversion in Visco-acoustic Media ⋮ Eigenvectors from eigenvalues: A survey of a basic identity in linear algebra ⋮ Zusammenfassender Bericht. Genauigkeitsfragen bei der Lösung linearer Gleichungssysteme ⋮ Solution of linear equations with coefficient matrix in band form ⋮ Updated triangular factors of the basis to maintain sparsity in the product form simplex method ⋮ $\mathcal{H}$-Matrix Based Second Moment Analysis for Rough Random Fields and Finite Element Discretizations ⋮ Structure probing neural network deflation ⋮ Wilkinson-type error analysis applied to double-precision accumulation under contamination ⋮ On the Zeros of the Riemann Zeta Function in the Critical Strip ⋮ Backward stability with almost strictly sign regular matrices ⋮ Transversal connecting orbits from shadowing ⋮ Improved Error Estimates for Numerical Solutions of Symmetric Integral Equations ⋮ On the efficiency of algorithms of analysis ⋮ Iterative Refinement Implies Numerical Stability for Gaussian Elimination ⋮ Finite algorithms for robust linear regression ⋮ On efficient two-parameter methods for solving nonlinear equations ⋮ Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides ⋮ On the condition of the zeros of characteristic polynomials ⋮ Computing the roots of sparse high-degree polynomials that arise from the study of random simplicial complexes ⋮ A branch-and-reduce approach to global optimization ⋮ On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots ⋮ Thin flow element and the problem of ill-conditioning ⋮ On the Lebesgue measure of the Feigenbaum Julia set ⋮ Iterative Refinement Revisited ⋮ Fast estimates for the diagonal of the inverse of large scale matrices appearing in applications ⋮ Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros ⋮ Hierarchical matrix approximation for the uncertainty quantification of potentials on random domains ⋮ An experiment with arithmetic precision in linear algebra computations ⋮ Stochastic arithmetic in multiprecision ⋮ Formal verification of numerical programs: from C annotated programs to mechanical proofs ⋮ Chebyshev rootfinding via computing eigenvalues of colleague matrices: when is it stable? ⋮ Perturbation Theory for Evaluation Algorithms of Arithmetic Expressions ⋮ Roundoff errors in floating-point summation ⋮ On the evaluation of rational triangular Bézier surfaces and the optimal stability of the basis ⋮ Two algorithms for periodic extension on uniform grids ⋮ Minimization of rounding errors algebraically by use of coding theory ⋮ Badness of small denominators in rational function evaluation ⋮ A SBS-BD based solver for domain decomposition in BE methods ⋮ An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process ⋮ Unnamed Item ⋮ A quantitative version of the observation that the Hadamard product is a principal submatrix of the Kronecker product ⋮ Fehleranalyse der Schmidtschen und Powellschen Orthonormalisierungsverfahren ⋮ Backward Error Analysis for Perturbation Methods ⋮ Unnamed Item ⋮ Comparison of the accuracies of some regression algorithms ⋮ The Gauss‐Bordering Method for Generalized Inversion of Matrices ⋮ Roundoff error analysis of fast DCT algorithms in fixed point arithmetic ⋮ Computation of the stationary distribution of a markov chain ⋮ The nearest polynomial to multiple given polynomials with a given zero: a unified optimization approach ⋮ Wilkinson-type error analysis applied to double-precision accumulation under contamination, II ⋮ The e-MoM approach for approximating matrix functionals ⋮ Extended version with the analysis of dynamic system for iterative refinement of solution ⋮ Error analysis of digital filters using HOL theorem proving ⋮ Componentwise error analysis for linear systems associated with sign regular matrices ⋮ Hölder Continuity of Roots of Complex andp-adic Polynomials ⋮ On the growth problem for skew and symmetric conference matrices ⋮ On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros ⋮ Détermination du pas optimal dans le calcul des dérivées sur ordinateur ⋮ Approximate calculation of triple integrals of rapidly oscillating functions with the use of Lagrange polynomial interflation ⋮ Error analysis of penalty function techniques for constraint definition in linear algebraic systems ⋮ Solving linear programs with finite precision. II: Algorithms ⋮ A program complex for solving systems of linear algebraic equations ⋮ Nitsche's method for linear Kirchhoff-Love shells: formulation, error analysis, and verification ⋮ A bump triangular dynamic factorization algorithm for the simplex method ⋮ Acceptable solutions and backward errors for tensor complementarity problems ⋮ Iterative refinement for Neville elimination ⋮ Iterative procedures for improving penalty function solutions of algebraic systems ⋮ A Stochastic Roundoff Error Analysis for the Convolution ⋮ Computing tensor Z-eigenvalues via shifted inverse power method ⋮ On the conditioning of polynomial and rational forms ⋮ Van der Monde systems and numerical differentiation ⋮ Correcting approximations to multiple roots of polynomials ⋮ Die numerische Berechnung der Wurzeln eines Polynoms ⋮ Über die Notwendigkeit einer Fehlerschranken-Arithmetik für Rechenautomaten ⋮ Some Numerical Results on Fekete Polynomials ⋮ An algorithm for the solution of certain kinds of linear equations ⋮ Ein Einschließungsverfahren für Nullstellen ⋮ Modification Methods for Inverting Matrices and Solving Systems of Linear Algebraic Equations ⋮ Stability of general systems of linear equations ⋮ Error analysis for the Newton-Raphson method ⋮ On the orthonormalization of sparse vectors ⋮ A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration ⋮ Automatic errorbounds for the approximate solution of equations ⋮ Some iterations for factoring polynomials ⋮ Algorithms in unnormalized arithmetic. III: Matrix inversion ⋮ Error Bounds for Linear Recurrence Relations ⋮ Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity ⋮ Monitoring the numerical stability of Gaussian elimination ⋮ A stabilization of the simplex method ⋮ The fundamental theorem of algebra and complexity theory ⋮ Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices ⋮ An analysis of the effect of rounding errors on the flow of control in numerical processes ⋮ Heuristic search viewed as path finding in a graph ⋮ Deflation techniques for the calculation of further solutions of a nonlinear system ⋮ A posteriori error bounds for the zeros of a polynomial ⋮ On Measures of Ill-Conditioning for Nonlinear Equations ⋮ The behavior of a multiplicity independent root-finding scheme in the presence of error ⋮ The Probability That a Numerical Analysis Problem is Difficult ⋮ Eigenvalue condition numbers: zero-structured versus traditional. ⋮ Evaluation of the derivative of a polynomial in Bernstein form ⋮ An effective implementation of a modified Laguerre method for the roots of a polynomial ⋮ Further analysis of the quadrant interlocking factorisation (Q.I.F.) method ⋮ Roundoff error for floating point representation of real data ⋮ Recursive geometric integrators for wave propagation in a functionally graded multilayered elastic medium ⋮ Fast inverse Cholesky decomposition for rectangular Toeplitz-block matrix ⋮ Sharp ULP rounding error bound for the hypotenuse function ⋮ Running error analysis of evaluation algorithms for bivariate polynomials in barycentric Bernstein form ⋮ Entrywise perturbation theory and error analysis for Markov chains ⋮ Nodally exact Ritz discretizations of 1D diffusion-absorption and Helmholtz equations by variational FIC and modified equation methods ⋮ Spectral portrait for non-Hermitian large sparse matrices ⋮ The accurate solution of certain continuous problems using only single precision arithmetic ⋮ Computation of the monodromy matrix in floating point arithmetic with the Wilkinson model ⋮ A computable criterion for the existence of connecting orbits in autonomous dynamics ⋮ On summation formulas due to Plana, Lindelöf and Abel, and related Gauss-Christoffel rules. I ⋮ Stability analysis of a general Toeplitz system solver ⋮ Modified Newton method in circular interval arithmetic ⋮ The equivalence of decimation in time and decimation in frequency in FFT computations ⋮ Evaluation algorithms for multivariate polynomials in Bernstein-Bézier form ⋮ Robust stability analysis for discrete-time LQG system under finite wordlength effects, noise uncertainties and time-varying structured parameter perturbations ⋮ On the complexity of solving feasible systems of linear inequalities specified with approximate data ⋮ Sinc-type approximations in $H^ 1$-norm with applications to boundary value problems ⋮ Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints ⋮ Efficient computation of tridiagonal matrices largest eigenvalue ⋮ On developing a stable and quadratic convergent method for solving absolute value equation ⋮ A general method to generate parallel iterations for finding all zeros of polynomial simultaneously ⋮ Algorithms for roundoff error analysis - a relative error approach ⋮ On a test of programs for numerical zeros of polynomials ⋮ Round-off error analysis of iterations for large linear systems ⋮ Fehleranalyse für die Gauß-Elimination zur Berechnung der Lösung minimaler Länge ⋮ Remarks on the complexity of roundoff analysis ⋮ Étude statistique des erreurs dans l'ARITHM<ETIQUE DES ORDINATEURS, APPLICATIONS AU CONTR<OLE DES R<ESULTTS D'algorithmes numériques ⋮ On the condition of algebraic equations ⋮ Roundoff-error analysis of a new class of conjugate-gradient algorithms ⋮ Families of algebraic test equations ⋮ $\mathcal H$-matrix accelerated second moment analysis for potentials with rough correlation ⋮ A note on matrices with maximal growth factor for Neville elimination ⋮ On the use of history variables ⋮ Computational methods of linear algebra ⋮ Running error for the evaluation of rational Bézier surfaces through a robust algorithm ⋮ Iterative refinement for linear systems in variable-precision arithmetic ⋮ Increasing data locality and introducing level-3 BLAS in the neville elimination ⋮ Stability of a Runge-Kutta method for the Navier-Stokes equation ⋮ Asymptotic behaviour of Karmarkar's method for linear programming ⋮ Study on effective condition number for collocation methods ⋮ The numerical stability of evaluation schemes for polynomials based on the Lagrange interpolation form ⋮ Applied computational geometry: Towards robust solutions of basic problems ⋮ A method for finding the zeros of polynomials using a companion matrix. ⋮ A stable method for the evaluation of a polynomial and of a rational function of one variable ⋮ Seepage analysis in multi-domain general anisotropic media by three-dimensional boundary elements ⋮ System theoretic based characterisation and computation of the least common multiple of a set of polynomials. ⋮ Approximate iterations for structured matrices ⋮ Inverse power and Durand-Kerner iterations for univariate polynomial root-finding ⋮ Accurate evaluation of Bézier curves and surfaces and the Bernstein-Fourier algorithm ⋮ The Laguerre inequalities with applications to a problem associated with the Riemann hypothesis ⋮ Iterative refinement of the singular-value decomposition solution to the regression equations ⋮ Unconstrained and constrained global optimization of polynomial functions in one variable ⋮ Evaluation schemes in the ring of quaternionic polynomials ⋮ On the stability of solution methods for band Toeplitz systems ⋮ On a conjugate directions method for solving strictly convex QP problem ⋮ A note on the Davison-Man method for Sylvester matrix equations ⋮ Covariance regularity and $\mathcal {H}$-matrix approximation for rough random fields ⋮ Extended Neyman smooth goodness-of-fit tests, applied to competing heavy-tailed distributions ⋮ Are the coefficients of a polynomial well-conditioned functions of its roots? ⋮ Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence ⋮ Error analysis of two algorithms for the computation of the matrix exponential ⋮ A quantitative probabilistic investigation into the accumulation of rounding errors in numerical ODE solution ⋮ OSQP: An Operator Splitting Solver for Quadratic Programs ⋮ Méthode numérique de detection de la singularite d'une matrice ⋮ Accurate evaluation of a polynomial in Chebyshev form ⋮ Test of pole-zero cancellation in estimated models ⋮ A survey of techniques in applied computational complexity ⋮ Convergence of Newton-like methods for solving systems of nonlinear equations ⋮ On the solution of the linear least squares problems and pseudo-inverses ⋮ Numerical stability for solving nonlinear equations ⋮ Numerical stability of the Chebyshev method for the solution of large linear systems ⋮ Über die Einzugsbereiche der Nullstellen von Polynomen beim Newton-Verfahren ⋮ Nonlinear finite element analysis of curved beams ⋮ Parallel direct linear system solvers - a survey ⋮ On computing the best least squares solutions in Hilbert space ⋮ Isotropic distributions of test matrices ⋮ On the guaranteed convergence of new two-point root-finding methods for polynomial zeros ⋮ Block splitting for distributed optimization ⋮ Root squaring using level-index arithmetic ⋮ Schröder-like algorithms for multiple complex zeros of a polynomial ⋮ A modified fast Fourier transform for polynomial evaluation and the Jenkins-Traub algorithm ⋮ Forward error analysis of Gaussian elimination. I: Error and residual estimates ⋮ Forward error analysis of Gaussian elimination. II: Stability theorems ⋮ An interval algorithm for solving systems of linear equations to prespecified accuracy ⋮ Rounding error analysis of Horner's scheme ⋮ Formal analysis of the Schulz matrix inversion algorithm: a paradigm towards computer aided verification of general matrix flow solvers ⋮ The solution of infinitely ill-conditioned weakly-singular problems ⋮ Evaluation de l'incertitude sur la solution d'un système linéaire ⋮ A posteriori componentwise error estimate for a computed solution of a system of linear equations ⋮ The coordinex problem and its relation to the conjecture of Wilkinson ⋮ Experiments with data perturbations to study condition numbers and numerical stability ⋮ Numerical decomposition of a convex function ⋮ The focal point method for solving systems of linear equations ⋮ Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions ⋮ Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation ⋮ Real computations with fake numbers ⋮ Probabilistic error analysis of Gaussian elimination in floating point and logarithmic arithmetic ⋮ On the numerical computation of orbits of dynamical systems: The one- dimensional case ⋮ On a second order method for the simultaneous inclusion of polynomial complex zeros in rectangular arithmetic ⋮ Strict optimal a posteriori error and residual bounds for Gaussian elimination in floating-point arithmetic ⋮ A Krylov subspace generalization of the improved Wilkinson's algorithm for ill-conditioned linear systems ⋮ On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously

This page was built for publication: