scientific article; zbMATH DE number 862514

zbMATH Open0868.65027MaRDI QIDQ4871634FDOQ4871634

Publication date: 31 March 1996

Title of this publication is not available (Why is that?)

Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Roundoff error (65G50) Collected or selected works; reprintings or translations of classics (01A75) Numerical computation of solutions to single equations (65H05) Numerical linear algebra (65Fxx)

Cited In (only showing first 100 items - show all)

On estimating the condition of eigenvalues and eigenvectors
On the accuracy of solving triangular systems in parallel
New methods for evaluating the validity of the results of mathematical computations
Computational issues in solid boundary evaluation
Choose the damping, choose the ranking?
Floating-point error propagation in iterative methods
Affine invariant fitting of algebraic curves using Fourier descriptors
On the estimation of numerical error bounds in linear algebra based on discrete stochastic arithmetic
A two-level iteration method for solution of contact problems
A new insight into the consistency of the SPH interpolation formula
Perturbation bounds for polynomials
A stochastic partial differential equation for computational algorithms
Stability of the Gauss-Huard algorithm with partial pivoting
Symbolic-numeric sparse interpolation of multivariate polynomials
Stochastic Rounding Variance and Probabilistic Bounds: A New Approach
Quantified constraints under perturbation
Backward error analysis of Neville elimination
A verified method for bounding clusters of zeros of analytic functions
On the numerical condition of polynomials in Bernstein form
Algorithms for polynomials in Bernstein form
The weak and strong stability of algorithms in numerical linear algebra
Review on stochastic approach to round-off error analysis and its applications
Polynomial zerofinding iterative matrix algorithms
A composite polynomial zerofinding matrix algorithm
Iterative refinement of solution with biparameter for solving ill-conditioned systems of linear algebraic equations.
The numerical stability of simultaneous iterations via square-rooting
Computational complexity of iterated maps on the interval
New iterative improvement of a solution for an ill-conditioned system of linear equations based on a linear dynamic system.
Computation of the solutions of nonlinear polynomial systems
Fitting helices to data by total least squares
More on pseudospectra for polynomial eigenvalue problems and applications in control theory
Remarks on numerical algorithms for computing the inverse Laplace transform
Quadratically optimized polynomials for fermion simulations
Some substantial modifications and improvements for derivative-free iterative methods and derivative-free transformation for multiple zeros
On the numerical computation of orbits of dynamical systems: The higher dimensional case
A fast and robust computational method for the ionization cross sections of the driven Schrödinger equation using an \(\mathcal{O}(N)\) multigrid-based scheme
Khovanskii-Rolle continuation for real solutions
The natural factor formulation of the stiffness for the matrix displacement method
On numerical error in the finite element method
Spatial pattern formation in reaction-diffusion models: a computational approach
Error analysis of floating-point computation
Quasi-affine transformations: Tilings by reciprocal images
Comparison of round-off errors in integral equation formulations of elastostatical boundary value problems
Enclosing clusters of zeros of polynomials
Using monodromy to avoid high precision in homotopy continuation
A parallel algorithm for simple roots of polynomials
The geometry of ill-conditioning
Smoothed analysis of \(\kappa(A)\)
Measurement updating using the U-D factorization
Accelerating scientific computations with mixed precision algorithms
A one parameter family of locally quartically convergent zero-finding methods
Algebraic complexity of computing polynomial zeros
Real and complex pseudozero sets for polynomials with applications
A methodology for solving chemical equilibrium systems
The Bernstein polynomial basis: a centennial retrospective
Stochastic approach of the permutation-perturbation method for round-off error analysis
Running error for the evaluation of rational Bézier surfaces
An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
Stability of parallel algorithms to evaluate Chebyshev series
The numerical stability of the generalised root iterations for polynomial zeros
General scheme for solving linear algebraic problems by direct methods
Hyman's method revisited
Stability of the linear inequality method for rational Chebyshev approximation
Zwei unzulässige Verstärkungen der Vermutung von Wilkinson. (Two inadmissible amplifications of Wilkinson's conjecture)
Practical problems arising for finding roots of nonlinear equations
Consistent projections and indicators in pairwise comparisons
Accuracy and effectiveness of preconditioned conjugate gradient algorithms for large and ill-conditioned problems
A stabilization of the simplex method
Significance arithmetic: The carrying algorithm
Robust location of optical fiber modes via the argument principle method
Any iteration for polynomial equations using linear information has infinite complexity
Why does information-based complexity use the real number model?
Probabilistic Error Analysis for Inner Products
The accuracy of a parallel \(LU\) decomposition algorithm
On the complexity of solving feasible systems of linear inequalities specified with approximate data
Significance arithmetic: The probability of carrying
Pseudospectra, stability radii and their relationship with backward error for structured nonlinear eigenvalue problems
Optimal simulation lengths for various algorithms computing the mean
The bit-cost of some algorithms for the solution of linear systems
Evaluating user reputation in online rating systems via an iterative group-based ranking method
A statistical analysis of the numerical condition of multiple roots of polynomials.
Finding an optimal partition for a numerical integration using the trapezoidal rule
Title not available (Why is that?)
Analyzing the effect of local rounding error propagation on the maximal attainable accuracy of the pipelined conjugate gradient method
Error propagation in Fourier transforms
Détermination d'un pas optimum d'intégration pour la méthode de Simpson
All possible computed results in correct floating-point summation
Sparse discriminants and applications
A note on perturbation estimates for invariant subspaces of Hessenberg matrices
Stability Analysis of Inline ZFP Compression for Floating-Point Data in Iterative Methods
Stability analysis of interconnected discrete-time fractional-order LTI state-space systems
Computable error bounds for variational functionals of solutions of a convolution integral equations of the first kind
The numerical instability of Bini's algorithm
Summation of imprecise numbers
Correct rounding of algebraic functions
Title not available (Why is that?)
HomPINNs: Homotopy physics-informed neural networks for learning multiple solutions of nonlinear elliptic differential equations
Number shortening algorithms
On the accuracy of solving triangular systems in parallel. II
On the unitary block-decomposability of 1-parameter matrix flows and static matrices

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 Q4871634)