scientific article; zbMATH DE number 862514

Publication date: 31 March 1996

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

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

Related Items (only showing first 100 items - show all)

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

This page was built for publication: