scientific article; zbMATH DE number 846277
From MaRDI portal
Publication:4864704
automatic error analysisbackward error analysisfast Fourier transformfinite precision computationfloating point arithmeticforward error analysisGauss-Jordan eliminationIEEE arithmeticiterative refinementLAPACKNewton interpolating polynomialnumerical linear algebrasoftwaresolutions to problemsstabilitysystems of linear equationstest matricestextbook
Recommendations
- Accuracy and Stability of Numerical Algorithms
- scientific article; zbMATH DE number 53168
- scientific article; zbMATH DE number 930309
- Numerical linear algebra and applications
- Guaranteed accuracy in numerical linear algebra. Updated and rev. transl. of the original work 'The guaranteed precision of linear equations solutions in Euclidean spaces', publ. by Nauka 1992
Cited in
(only showing first 100 items - show all)- 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
- Stability of block LU factorization for block tridiagonal matrices
- 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
- Solving Toeplitz systems after extension and transformation
- Construction of two-step Runge-Kutta methods of high order of ordinary differential equations
- On the sensitivity of the LU factorization
- Why does information-based complexity use the real number model?
- 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
- Pivoting and backward stability of fast algorithms for solving Cauchy linear equations
- Inversion error, condition number, and approximate inverses of uncertain matrices
- Overestimations in bounding solutions of perturbed linear equations
- A greedy algorithm for the optimal basis problem
- Theorems of Perron-Frobenius type for matrices without sign restrictions
- 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
- Mechanism free domain decomposition
- 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
- A statistical analysis of the numerical condition of multiple roots of polynomials.
- Performance of Gauss implicit Runge-Kutta methods on separable Hamiltonian systems.
- 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.
- The fractal property of the Lorenz attractor
- 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
- 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
- Real computations with fake numbers
- Quantified constraints under perturbation
- Approximation of nonnegative functions by means of exponentiated trigonometric polynomials
- 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
- 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
- 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\)
- A note on high-precision approximation of asymptotically decaying solution and orthogonal decomposition
- Kernel spectral clustering with memory effect
- On developing a stable and quadratic convergent method for solving absolute value equation
- Stability and accuracy of inexact interior point methods for convex quadratic programming
- Random perturbation of low rank matrices: improving classical bounds
- Conjugate direction methods and polarity for quadratic hypersurfaces
- Perturbation and error analyses of the partitioned \textit{LU} factorization for block tridiagonal linear systems
- 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
- 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
- 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
- Numerically robust delta-domain solutions to discrete-time Lyapunov equations.
- Additive symmetries: The non-negative case.
- Rounding error and perturbation bounds for the symplectic QR factorization
- The Riccati algorithm for eigenvalues and invariant subspaces of matrices with inexpensive action
- Computing tall skinny solutions of \(AX-XB=C\)
- Numerical evaluation of the \(p\)th derivative of Jacobi series
- A companion matrix resultant for Bernstein polynomials
- On the numerical evaluation of linear recurrences
- Perron-Frobenius theory for complex matrices
- 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
- Smoothed analysis of \(\kappa(A)\)
- Combinatorial characterization of the null spaces of symmetric H-matrices
- On the computation of maximum minors of Hadamard matrices
- Perturbation and error analyses for block downdating of a Cholesky decomposition
- 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
- An investigation of feasible descent algorithms for estimating the condition number of a matrix
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4864704)