Numerical inverting of matrices of high order
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Report on test matrices for generalized inverses
- Probabilistic error analysis of Gaussian elimination in floating point and logarithmic arithmetic
- 33 years of numerical instability. I
- Application of the concept of the conditioning of a matrix to an identification problem
- On block diagonal and Schur complement preconditioning
- Real computations with fake numbers
- Lower bounds for the smallest singular value of structured random matrices
- Random matrices: overcrowding estimates for the spectrum
- Fixed energy universality of Dyson Brownian motion
- The smallest singular value of a shifted d-regular random square matrix
- Probabilistic analysis of complex Gaussian elimination without pivoting
- Smoothed analysis of \(\kappa(A)\)
- On the complexity of solving feasible systems of linear inequalities specified with approximate data
- Computational complexity of kernel-based density-ratio estimation: a condition number analysis
- Sampling the eigenvalues of random orthogonal and unitary matrices
- Sharp transition of the invertibility of the adjacency matrices of sparse random graphs
- The smallest singular value of inhomogeneous square random matrices
- Spectral statistics of non-selfadjoint operators subject to small random perturbations
- The smallest singular value of heavy-tailed not necessarily i.i.d. random matrices via random rounding
- Statistical approach for highest precision numerical differentiation
- The asymptotic distribution of the condition number for random circulant matrices
- A remark on the smallest singular value of powers of Gaussian matrices
- Trefftz approximations in complex media: accuracy and applications
- Computing the homology of semialgebraic sets. I: Lax formulas
- A modern retrospective on probabilistic numerics
- On local analysis
- Roundoff error analysis of fast DCT algorithms in fixed point arithmetic
- Upper bounds on the distribution of the condition number of singular matrices
- Algorithms in unnormalized arithmetic. III: Matrix inversion
- Eine Konvergenzverbesserung für die Newtonsche Methode
- Programmgesteuerte digitale Rechengeräte (elektronische Rechenmaschinen)
- The condition of certain matrices. II
- Condition numbers for the cube. I: Univariate polynomials and hypersurfaces
- Towards classical hardness of module-LWE: the linear rank case
- Single level constraint interval arithmetic
- A survey on the eigenvalues local behavior of large complex correlated Wishart matrices
- On a condition number of general random polynomial systems
- Outlier eigenvalues for deformed i.i.d. random matrices
- The Legacy of Turing in Numerical Analysis
- Smooth analysis of the condition number and the least singular value
- Computation of the monodromy matrix in floating point arithmetic with the Wilkinson model
- The relative efficiency of the restricted estimators in linear regression models
- Some properties of the proper values of a matrix
- El metodo del «simplex» de la programacion lineal
- John von Neumann 1903-1957
- Von Neumann’s contributions to automata theory
- scientific article; zbMATH DE number 3137691 (Why is no real title available?)
- A Modification of the Runge-Kutta Fourth-Order Method
- A Random Walk Through Experimental Mathematics
- Floating-point arithmetic on the test bench. How are verified numerical solutions calculated?
- On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case
- Finite element exterior calculus: From Hodge theory to numerical stability
- The probability that a slightly perturbed numerical analysis problem is difficult
- Roundoff error distribution in fixed point multiplication
- scientific article; zbMATH DE number 29052 (Why is no real title available?)
- On round-off error in fixed-point multiplication
- The use of preconditioning in direct methods of solving positive definite linear systems
- Rounding Proportions:Rules of Rounding
- Complex random matrices have no real eigenvalues
- Seepage analysis in multi-domain general anisotropic media by three-dimensional boundary elements
- On the epistemological analysis of modeling and computational error in the mathematical sciences
- Combining the unrestricted estimators into a single estimator and a simulation study on the unrestricted estimators
- scientific article; zbMATH DE number 7626747 (Why is no real title available?)
- How well-conditioned can the eigenvector problem be?
- Gaussian determinantal processes: a new model for directionality in data
- Probabilistic Error Analysis for Inner Products
- A theory of complexity, condition, and roundoff
- Invertibility of sparse non-Hermitian matrices
- A New Approach to Probabilistic Rounding Error Analysis
- The probabilistic estimates on the largest and smallest q-singular values of random matrices
- On the expectation of operator norms of random matrices
- Practical aspects of interval computation
- scientific article; zbMATH DE number 3329396 (Why is no real title available?)
- Probabilistic analyses of condition numbers
- Solving linear algebraic equations can be interesting
- scientific article; zbMATH DE number 3088048 (Why is no real title available?)
- Generation of errors in digital computation
- Motivation for working in numerical analysis
- Mixed precision algorithms in numerical linear algebra
- A smooth transition towards a Tracy–Widom distribution for the largest eigenvalue of interacting k-body fermionic embedded Gaussian ensembles
- Stochastic Rounding Variance and Probabilistic Bounds: A New Approach
- Conditioning of linear systems arising from penalty methods
- Rare events in random matrix theory
- Quantitative invertibility of non-Hermitian random matrices
- Norms of structured random matrices
- Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time
- Rounding error analysis of linear recurrences using generating series
- Entropic hardness of Module-LWE from module-NTRU
- Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing
- Some remarks on the condition number of a real random square matrix
- On the computation of the homology of semialgebraic sets
- Moving horizon estimation for nonlinear systems subject to measurement outliers
- Phase transition of eigenvalues in deformed Ginibre ensembles. I: GinUE
- Quantifying the effectiveness of linear preconditioning in Markov chain Monte Carlo
- A new upper bound for the growth factor in Gaussian elimination with complete pivoting
- A comparison of mixed precision iterative refinement approaches for least-squares problems
- Stochastic rounding implicitly regularizes tall-and-thin matrices
- A stochastic partial differential equation for computational algorithms
- A complete finite axiomatisation of the equational theory of common meadows
- How ordinary elimination became Gaussian elimination
This page was built for publication: Numerical inverting of matrices of high order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5788100)