The following pages link to (Q4342463):
Displaying 50 items.
- A branch-and-reduce approach to global optimization (Q1924068) (← links)
- Stochastic arithmetic in multiprecision (Q1949764) (← links)
- Formal verification of numerical programs: from C annotated programs to mechanical proofs (Q1949765) (← links)
- On the evaluation of rational triangular Bézier surfaces and the optimal stability of the basis (Q1955532) (← links)
- A quantitative version of the observation that the Hadamard product is a principal submatrix of the Kronecker product (Q1970491) (← links)
- The nearest polynomial to multiple given polynomials with a given zero: a unified optimization approach (Q1985438) (← links)
- The e-MoM approach for approximating matrix functionals (Q1989169) (← links)
- On the convergence of Gander's type family of iterative methods for simultaneous approximation of polynomial zeros (Q2008912) (← links)
- Nitsche's method for linear Kirchhoff-Love shells: formulation, error analysis, and verification (Q2021229) (← links)
- Acceptable solutions and backward errors for tensor complementarity problems (Q2026729) (← links)
- Computing tensor Z-eigenvalues via shifted inverse power method (Q2043206) (← links)
- Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices (Q2061400) (← links)
- Structure probing neural network deflation (Q2124019) (← links)
- Computing the roots of sparse high-degree polynomials that arise from the study of random simplicial complexes (Q2173347) (← links)
- On the Lebesgue measure of the Feigenbaum Julia set (Q2187254) (← links)
- Two algorithms for periodic extension on uniform grids (Q2220736) (← links)
- Componentwise error analysis for linear systems associated with sign regular matrices (Q2252692) (← links)
- Approximate calculation of triple integrals of rapidly oscillating functions with the use of Lagrange polynomial interflation (Q2263293) (← links)
- An effective implementation of a modified Laguerre method for the roots of a polynomial (Q2334816) (← links)
- Transversal connecting orbits from shadowing (Q2373393) (← links)
- On efficient two-parameter methods for solving nonlinear equations (Q2391884) (← links)
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides (Q2395674) (← links)
- On the condition of the zeros of characteristic polynomials (Q2402421) (← links)
- Fast estimates for the diagonal of the inverse of large scale matrices appearing in applications (Q2423594) (← links)
- Convergence analysis of Sakurai-Torii-Sugiura iterative method for simultaneous approximation of polynomial zeros (Q2424923) (← links)
- Hierarchical matrix approximation for the uncertainty quantification of potentials on random domains (Q2425284) (← links)
- A SBS-BD based solver for domain decomposition in BE methods (Q2451017) (← links)
- An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process (Q2451655) (← links)
- Roundoff error analysis of fast DCT algorithms in fixed point arithmetic (Q2463439) (← links)
- Error analysis of digital filters using HOL theorem proving (Q2475434) (← links)
- On the growth problem for skew and symmetric conference matrices (Q2484489) (← links)
- Solving linear programs with finite precision. II: Algorithms (Q2496177) (← links)
- On the conditioning of polynomial and rational forms (Q2522175) (← links)
- Van der Monde systems and numerical differentiation (Q2522604) (← links)
- Correcting approximations to multiple roots of polynomials (Q2525762) (← links)
- Die numerische Berechnung der Wurzeln eines Polynoms (Q2526246) (← links)
- Über die Notwendigkeit einer Fehlerschranken-Arithmetik für Rechenautomaten (Q2526600) (← links)
- An algorithm for the solution of certain kinds of linear equations (Q2527873) (← links)
- Ein Einschließungsverfahren für Nullstellen (Q2528077) (← links)
- Stability of general systems of linear equations (Q2531756) (← links)
- Error analysis for the Newton-Raphson method (Q2532212) (← links)
- On the orthonormalization of sparse vectors (Q2532738) (← links)
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration (Q2533492) (← links)
- Automatic errorbounds for the approximate solution of equations (Q2534802) (← links)
- Some iterations for factoring polynomials (Q2534803) (← links)
- Algorithms in unnormalized arithmetic. III: Matrix inversion (Q2535918) (← links)
- Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity (Q2538448) (← links)
- Monitoring the numerical stability of Gaussian elimination (Q2538763) (← links)
- A stabilization of the simplex method (Q2540164) (← links)
- Heuristic search viewed as path finding in a graph (Q2542693) (← links)