scientific article; zbMATH DE number 846277

Publication date: 20 February 1996

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

software stability textbook fast Fourier transform numerical linear algebra floating point arithmetic backward error analysis systems of linear equations forward error analysis Gauss-Jordan elimination iterative refinement IEEE arithmetic test matrices LAPACK automatic error analysis finite precision computation Newton interpolating polynomial solutions to problems

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Roundoff error (65G50) Software, source code, etc. for problems pertaining to linear algebra (15-04) Numerical linear algebra (65Fxx)

Related Items

Real structure-preserving algorithms of Householder based transformations for quaternion matrices, Wilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblems, Pivoting and backward stability of fast algorithms for solving Cauchy linear equations, Inversion error, condition number, and approximate inverses of uncertain matrices, On Smith-type iterative algorithms for the Stein matrix equation, Minimizing synchronizations in sparse iterative solvers for distributed supercomputers, Computation of the monodromy matrix in floating point arithmetic with the Wilkinson model, Adaptive version of simpler GMRES, Numerical verification methods for spherical $t$-designs, Numerical solution of boundary value problems for selfadjoint differential equations of $2n$th order., Semantics of roundoff error propagation in finite precision calculations, Routes to chaos in high-dimensional dynamical systems: a qualitative numerical study, Overestimations in bounding solutions of perturbed linear equations, The solution of linear systems by using the Sherman-Morrison formula, A numerical method for computing the Hamiltonian Schur form, A new recurrence relation and related determinantal form for binomial type polynomial sequences, A greedy algorithm for the optimal basis problem, Long-tail distribution based multiscale-multiband autoregressive detection for hyperspectral imagery, On the Kronecker products and their applications, Stability of parallel algorithms for polynomial evaluation, High-precision numerical simulations on a CUDA GPU: Kerr black hole tails, The aggregation and cancellation techniques as a practical tool for faster matrix multiplication, Numerical factorization of multivariate complex polynomials, Another preprocessing algorithm for generalized one-dimensional fast multipole method, Finding the orthogonal projection of a point onto an affine subspace, Solving integral equations on piecewise smooth boundaries using the RCIP method: a tutorial, Vandermonde matrices on Chebyshev points, On the adjugate matrix, Sensitivity analyses for factorizations of sparse or structured matrices, A fast method to diagonalize a Hankel matrix, DFT representations of Toeplitz-plus-Hankel Bézoutians with application to fast matrix-vector multiplication, Interval linear systems: the state of the art, Solving Toeplitz systems after extension and transformation, A primal-dual symmetric relaxation for homogeneous conic systems, Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case, An alternative full-pivoting algorithm for the factorization of indefinite symmetric matrices, Stability of block $LU$ factorization for block tridiagonal block $H$-matrices, A condensation-based application of Cramer's rule for solving large-scale linear systems, An implicitly-restarted Krylov subspace method for real symmetric/skew-symmetric eigenproblems, A note on matrices with maximal growth factor for Neville elimination, Random orthogonal matrix simulation, Bernstein Bézoutians and application to intersection problems, Stopping rules and backward error analysis for bound-constrained optimization, Some results on determinants and inverses of nonsingular pentadiagonal matrices, Immersed b-spline (i-spline) finite element method for geometrically complex domains, Backward stability analysis of weighted linear least-squares problems, An accurate polynomial approximation of exponential integrators, Remarks on numerical algorithms for computing the inverse Laplace transform, Acceleration of generalized hypergeometric functions through precise remainder asymptotics, Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods, The three-term recursion for Chebyshev polynomials is mixed forward-backward stable, On iterative algorithms for the polar decomposition of a matrix and the matrix sign function, An interpolation problem on the circle between Lagrange and Hermite problems, A best upper bound for the 2-norm condition number of a matrix, On optimal backward perturbation bounds for the linear least squares problem, Performance of perturbation methods on orbit prediction, Backward error analysis of Neville elimination, Block matrices and symmetric perturbations, Nonsingularity, positive definiteness, and positive invertibility under fixed-point data rounding., Upper and lower bounds on norms of functions of matrices, A numerical algorithm for zero counting. I: Complexity and accuracy, How accurate are the extremely small $P$-values used in genomic research: an evaluation of numerical libraries, Backward error analysis of the AllReduce algorithm for Householder QR decomposition, Error analysis for matrix eigenvalue algorithm based on the discrete hungry Toda equation, Stress calculations on multiply connected domains, Very large electronic structure calculations using an out-of-core filter-diagonalization method, A Hamiltonian Krylov-Schur-type method based on the symplectic Lanczos process, Some results on condition numbers of the scaled total least squares problem, A quantitative probabilistic investigation into the accumulation of rounding errors in numerical ODE solution, A determinantal approach to Appell polynomials, On the degree elevation of Bernstein polynomial representation, Hierarchical LU decomposition-based preconditioners for BEM, Generation and evaluation of orthogonal polynomials in discrete Sobolev spaces. II: numerical stability, JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices, Fast computation of the Gauss hypergeometric function with all its parameters complex with application to the Pöschl-Teller-Ginocchio potential wave functions, A collection of examples where Neville elimination outperforms Gaussian elimination, Analysis of the solution of the Sylvester equation using low-rank ADI with exact shifts, On the inverses of general tridiagonal matrices, Parameter estimation for exponential sums by approximate prony method, An approach of orthogonalization within the Gram-Schmidt algorithm, Efficient traveltime solutions of the acoustic TI eikonal equation, An algebraic approach to Lidstone polynomials, An improved Toeplitz algorithm for polynomial matrix null-space computation, The scaling and modified squaring method for matrix functions related to the exponential, Hyman's method revisited, A new method for computing Moore-Penrose inverse matrices, Construction of two-step Runge-Kutta methods of high order of ordinary differential equations, On the sensitivity of the LU factorization, Stability of block LU factorization for block tridiagonal matrices, Why does information-based complexity use the real number model?, Multiple linear regression models for random intervals: a set arithmetic approach, Variable step implementation of geometric integrators, Stable spectral methods for conservation laws on triangles with unstructured grids, Structured backward errors for KKT systems, Stability of block LDL$^T$ factorization of a symmetric tridiagonal matrix, Two-sided bounds on the inverses of diagonally dominant tridiagonal matrices, The Gauss-Huard algorithm and LU factorization, On matrices for which norm bounds are attained, Structured perturbations and symmetric matrices, The loss of orthogonality in the Gram-Schmidt orthogonalization process, Rapid multiplication modulo the sum and difference of highly composite numbers, THE METHOD OF SPLITTING OPERATORS AND LYAPUNOV MAJORANTS IN PERTURBATION LINEAR ALGEBRA AND CONTROL, Lower estimates on the condition number of a Toeplitz sinc matrix and related questions, Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction, Pseudozeros of multivariate polynomials, Row-wise algorithms of ST decomposition, Pinchings and Norms of Scaled Triangular Matrices, Accurate floating-point summation: a new approach, Computational Methods for Linear Matrix Equations, Efficient solution of $A x^{(k)}= b^{(k)}$ using $A^{ - 1}$, A Matrix Approach to the Newton Formula and Divided Differences, The $QR$ Steps with Perfect Shifts, Conditioning of finite element equations with arbitrary anisotropic meshes, Gram-Schmidt orthogonalization: 100 years and more, Condition numbers for the tensor rank decomposition, A Note on Perturbation Estimates for Invariant Subspaces of Hessenberg Matrices, On alternating maximization algorithm for computing the hump of matrix powers, Spatially quasi-periodic bifurcations from periodic traveling water waves and a method for detecting bifurcations using signed singular values, Stability analysis of block factorization for complex symmetric block tridiagonal matrices, Sampling algebraic sets in local intrinsic coordinates, The Condition Number of Join Decompositions, Some discrete inequalities for central-difference type operators, CNN‐based ultrafast solver of stiff ODEs and PDEs for enabling realtime Computational Engineering, Matrices with Hierarchical Low-Rank Structures, $LDL^T$ Direction Interior Point Method for Semidefinite Programming, Efficient Spherical Designs with Good Geometric Properties, Bayesian spatio-temporal models based on discrete convolutions, Numerical method for the solution of the regulator equation with application to nonlinear tracking, On the existence of Eshelby’s equivalent ellipsoidal inclusion solution, PERTURBATION THEORY FOR THE LU AND QR FACTORIZATIONS, An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process, Backward Error Analysis for Perturbation Methods, A note on cycling LP examples with permutation structure, Tolerances, robustness and parametrization of matrix properties related to optimization problems, Remeshing criteria and proper error representations for goal oriented $h$-adaptivity, Datum transformation by Gauss projection of the ellipsoid onto the sphere and bilinear function of complex variable: An application to ETRS89-ED50, Solution of the fully fuzzy linear systems using iterative techniques, An error analysis of the modified scaling and squaring method, A structured rank-revealing method for Sylvester matrix, On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic, Unnamed Item, Stability of the MGS-like elimination method for equality constrained least squares problems, Vandermonde matrices with Chebyshev nodes, Statistical Condition Estimation for Linear Systems, Data-Parallel Sparse Factorization, Perturbation bounds for polynomials, Flocking in noisy environments, On the perturbation of the Q‐factor of the QR factorization, Tolerances in geometric constraint problems, A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF, On the inversion of the Vandermonde matrix, Vandermonde systems on equidistant nodes in $[0,1$: accurate computation], Error estimation in preconditioned conjugate gradients, Fast and stable contour integration for high order divided differences via elliptic functions, On the generalized Ball bases, Effective condition number for numerical partial differential equations, Low rank solution of data‐sparse Sylvester equations, Padé and Gregory error estimates for the logarithm of block triangular matrices, Solving linear programs with finite precision. II: Algorithms, An arithmetic for matrix pencils: theory and new algorithms, Metamodeling and robust minimization approach for the identification of elastic properties of composites by vibration method, Structured condition numbers of large Toeplitz matrices are rarely better than usual condition numbers, On theoretical and numerical aspects of symplectic Gram-Schmidt-like algorithms, Computing singular values of diagonally dominant matrices to high relative accuracy, Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials, Using cross-product matrices to compute the SVD, Stability Analysis of the Two-level Orthogonal Arnoldi Procedure, Iterative refinement for Neville elimination, Mathematically rigorous global optimization in floating-point arithmetic, On the robustness of numerical algorithms for linear systems and signal processing in finite precision arithmetic, The hyperbolic elimination method for solving the equality constrained indefinite least squares problem, Perturbation analysis for circles, spheres, and generalized hyperspheres fitted to data by geometric total least-squares, Convergence analysis of the finite difference ADI scheme for the heat equation on a convex set, An Error Correction Solver for Linear Systems: Evaluation of Mixed Precision Implementations, Signal Processing based on Stable radix-2 DCT I-IV Algorithms having Orthogonal Factors, Matrix Arithmetic-Geometric Mean and the Computation of the Logarithm, On the stability of computing polynomial roots via confederate linearizations, Gaussian elimination is stable for the inverse of a diagonally dominant matrix, Theory versus practice in annealing-based quantum computing, Perturbations of Triangular Matrix Factorizations, In Praise of Numerical Computation, Numerical methods for nonlinear equations, Rounding Error Analysis of Mixed Precision Block Householder QR Algorithms, A family of Anadromic numerical methods for matrix Riccati differential equations, Block LU factorization is stable for block matrices whose inverses are block diagonally dominant, Lower bounds for the condition number of a real confluent Vandermonde matrix, On the convergence of the generalized linear least squares algorithm, Evaluation of the derivative of a polynomial in Bernstein form, Unnamed Item, Approximating the extreme Ritz values and upper bounds for the $A$-norm of the error in CG, Vandermonde systems on Gauss-Lobatto Chebyshev nodes, Estimating differential quantities using polynomial fitting of osculating jets, Least squares methods in maximum likelihood problems, Numerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions, Accuracy of one step of the Falk-Langemeyer method, A framework of conjugate direction methods for symmetric linear systems in optimization, Linearization estimates of the backward errors for least squares problems, Stable trajectory of logistic map, Sharp ULP rounding error bound for the hypotenuse function, Newton's Method in Mixed Precision, Ensembles and Experiments in Classical and Quantum Physics, Simultaneous backward stability of Gauss and Gauss–Jordan elimination, Further analysis of Kahan’s algorithm for the accurate computation of $2\times 2$ determinants, Algebraic compressed sensing, An automatic quadrature method for semi-infinite integrals of exponentially decaying functions and its Matlab code, Numerical solution of singular Sylvester equations, Construction of Mercedes-Benz frames via QR factorization, Enabling floating-point arithmetic in the Coq proof assistant, Perturbation Theory of Transfer Function Matrices, Parallel vectorized implementations of compensated summation algorithms, Eigenvalue characterization of some structured matrix pencils under linear perturbation, A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem, Accuracy and Efficiency in Fixed-Point Neural ODE Solvers, The influence of numerical error on parameter estimation and uncertainty quantification for advective PDE models, Primitive Floats in Coq, Fast computation of zeros of polynomial systems with bounded degree under finite-precision, Numerical stability of biorthogonal wavelet transforms, Vector fitting by pole relocation for the state equation approximation of nonrational transfer matrices, Probabilistic analyses of condition numbers, Complex variable boundary integral equations for perforated infinite planes, An efficient direct solver for a class of mixed finite element problems, On the minors of the implicitization Bézout matrix for a rational plane curve, Fast algorithms for the Sylvester equation $AX-XB^{T}=C$, Numerical solutions of symmetric saddle point problem by direct methods, Regularized spectral multipole BEM for plane elasticity, New recurrent algorithm for a matrix inversion, Implementation of high-order implicit Runge-Kutta methods, Stability of parallel algorithms to evaluate Chebyshev series, A study of Auchmuty's error estimate, On the geometry of Graeffe iteration, An efficient conjugate direction method with orthogonalization for large-scale quadratic optimization problems, Perturbation analysis for the eigenproblem of periodic matrix pairs, The generalized triangular decomposition, Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series, Lower triangular Toeplitz-Ramanujan systems whose solution yields the Bernoulli numbers, Pencil-Based Algorithms for Tensor Rank Decomposition are not Stable, Validated Evaluation of Special Mathematical Functions, Subspace Iteration Randomization and Singular Value Problems, The Condition Number of Riemannian Approximation Problems, Fast and Backward Stable Computation of Roots of Polynomials, Algorithm 946, On the Error of Computing ab + cd using Cornea, Harrison and Tang's Method, Highly accurate verified error bounds for Krylov type linear system solvers, Complete stagnation of GMRES, On the nature of the spectrum of the quasi-periodic Schrödinger operator., An error estimate for matrix equations, Beyond the Courant-Friedrichs-Lewy condition: numerical methods for the wave problem using deep learning, Smoothed analysis of $\kappa(A)$, Combinatorial characterization of the null spaces of symmetric H-matrices, On the computation of maximum minors of Hadamard matrices, The Williams step increases the stability and accuracy of the hoRA time filter, Mixed forward-backward stability of the two-level orthogonal Arnoldi method for quadratic problems, Two inverse-of-$N$-free methods for $A_{M,N}^\dagger$, Theorems of Perron-Frobenius type for matrices without sign restrictions, Perturbation and error analyses for block downdating of a Cholesky decomposition, A note on high-precision approximation of asymptotically decaying solution and orthogonal decomposition, On the complexity of the Plantinga-Vegter algorithm, Estimation of optimal backward perturbation bounds for the linear least squares problem, Backward stability of a pivoting strategy for sign-regular linear systems, The growth factor and efficiency of Gaussian elimination with rook pivoting, The Laplace equation in three dimensions by the method of fundamental solutions and the method of particular solutions, Kernel spectral clustering with memory effect, On developing a stable and quadratic convergent method for solving absolute value equation, Convergence in finite precision of successive iteration methods under high nonnormality, On the condition number of linear least squares problems in a weighted Frobenius norm, Stability and accuracy of inexact interior point methods for convex quadratic programming, Random perturbation of low rank matrices: improving classical bounds, An investigation of feasible descent algorithms for estimating the condition number of a matrix, Mechanism free domain decomposition, Conjugate direction methods and polarity for quadratic hypersurfaces, Further properties of random orthogonal matrix simulation, Rounding error analysis of two-stage iterative methods for large linear systems, Smooth and adaptive gradient method with retards, Modified ST algorithms and numerical experiments, $\Delta_h$-Appell sequences and related interpolation problem, A statistical analysis of the numerical condition of multiple roots of polynomials., Performance of Gauss implicit Runge-Kutta methods on separable Hamiltonian systems., Performance and stability of direct methods for computing generalized inverses of the graph Laplacian, Stability analysis for the penalty plus hybrid and the direct Trefftz methods for singularity problems, Stability analysis and superconvergence for the penalty Trefftz method coupled with FEM for singularity problems, More accuracy at fixed precision., Computing the sign or the value of the determinant of an integer matrix, a complexity survey., Stress computations on perforated polygonal domains., Nonlinear data-bounded polynomial approximations and their applications in ENO methods, Conditioning of implicit Runge-Kutta integration for finite element approximation of linear diffusion equations on anisotropic meshes, Comparisons of method of fundamental solutions, method of particular solutions and the MFS-QR; stability analysis, A fast parallel Björck-Pereyra-type algorithm for solving Cauchy linear equations, The fractal property of the Lorenz attractor, Perturbation and error analyses of the partitioned \textit{LU} factorization for block tridiagonal linear systems, On the numerical integration of orthogonal flows with Runge-Kutta methods, Rounding-error and perturbation bounds for the indefinite QR factorization, QR factorization with complete pivoting and accurate computation of the SVD, Exponential splittings of products of matrices and accurately computing singular values of long products, The influence of orthogonality on the Arnoldi method, A modified Gram-Schmidt algorithm with iterative orthogonalization and column pivoting, Computing the spectral decomposition of interval matrices and a study on interval matrix powers, The e-MoM approach for approximating matrix functionals, Signal flow graph approach to efficient and forward stable DST algorithms, Lidstone approximation on the triangle, A structure-preserving doubling algorithm for continuous-time algebraic Riccati equations, The geometric mean decomposition, Fast and numerically stable algorithms for discrete cosine transforms, Formal proofs of rounding error bounds. With application to an automatic positive definiteness check, Multivalued fractals, On improving the accuracy of Horner's and Goertzel's algorithms, Relaxation strategies for nested Krylov methods, Product-form Cholesky factorization in interior point methods for second-order cone programming, Riemannian inexact Newton method for structured inverse eigenvalue and singular value problems, Algorithms for indefinite linear least squares problems, An accurate approximation of exponential integrators for the Schrödinger equation, Optimal truncations for multivariate Fourier and Chebyshev series: mysteries of the hyperbolic cross. I: bivariate case, A unified approach to remeshing strategies for finite element $h$-adaptivity, Interval solutions for interval algebraic equations, Componentwise pseudospectrum of a matrix, Probabilistic analysis of complex Gaussian elimination without pivoting, Geometric means, Schur complement reduction in the mixed-hybrid approximation of Darcy's law: Rounding error analysis, Pin-pointing solution of ill-conditioned square systems of linear equations, A tutorial history of least squares with applications to astronomy and geodesy, Numerical methods in control, Symbiosis between linear algebra and optimization, Numerically robust delta-domain solutions to discrete-time Lyapunov equations., Additive symmetries: The non-negative case., Some new properties of the equality constrained and weighted least squares problem, Condition number bounds for problems with integer coefficients, Numerical homotopies to compute generic points on positive dimensional algebraic sets, Rounding error and perturbation bounds for the symplectic QR factorization, The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action, \textsf{ORTHOPOLY}: a library for accurate evaluation of series of classical orthogonal polynomials and their derivatives, Real computations with fake numbers, Quantified constraints under perturbation, Computing tall skinny solutions of $AX-XB=C$, Numerical evaluation of the $p$th derivative of Jacobi series, Approximation of nonnegative functions by means of exponentiated trigonometric polynomials, A companion matrix resultant for Bernstein polynomials, On the numerical evaluation of linear recurrences, A constructive algorithm for finding the exact roots of polynomials with computable real coefficients., On the decay rate of Hankel singular values and related issues, Perron-Frobenius theory for complex matrices, Numerical solution and perturbation theory for generalized Lyapunov equations, More on pseudospectra for polynomial eigenvalue problems and applications in control theory, A unified approach for degree reduction of polynomials in the Bernstein basis. I: Real polynomials

Uses Software