scientific article; zbMATH DE number 1024452
From MaRDI portal
Publication:4342463
zbMath1041.65502MaRDI QIDQ4342463
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 (only showing first 100 items - show all)
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 ⋮ Towards understanding CG and GMRES through examples ⋮ 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 a quality measure for interval inclusions ⋮ CPFloat: a C library for simulating low-precision arithmetic ⋮ Multigrid methods using block floating point arithmetic ⋮ Homoclinic chaos in a perennial grass model ⋮ 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 ⋮ 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
This page was built for publication: