Numerical inverting of matrices of high order

From MaRDI portal
Revision as of 05:17, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5788100

DOI10.1090/S0002-9904-1947-08909-6zbMath0031.31402WikidataQ108698482 ScholiaQ108698482MaRDI QIDQ5788100

H. H. Goldstine, Johann von Neumann

Publication date: 1947

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)




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

On the Expectation of Operator Norms of Random MatricesSingle level constraint interval arithmeticSmooth analysis of the condition number and the least singular valueWilkinson's bus: weak condition numbers, with an application to singular polynomial eigenproblemsMixed precision algorithms in numerical linear algebraLower bounds for the smallest singular value of structured random matricesThe Legacy of Turing in Numerical AnalysisRigorous roundoff error analysis of probabilistic floating-point computationsSmoothed analysis of \(\kappa(A)\)The relative efficiency of the restricted estimators in linear regression modelsComputation of the monodromy matrix in floating point arithmetic with the Wilkinson modelTheory of an interval algebra and its application to numerical analysisOn verified numerical computations in convex programmingFloating-point arithmetic on the test bench. How are verified numerical solutions calculated?How well-conditioned can the eigenvector problem be?Eine Konvergenzverbesserung für die Newtonsche MethodeProgrammgesteuerte digitale Rechengeräte (elektronische Rechenmaschinen)Random matrices: overcrowding estimates for the spectrumGaussian determinantal processes: A new model for directionality in dataUnnamed ItemSmoothed analysis of complex conic condition numbersThe condition of certain matrices. IIRounding Proportions:Rules of RoundingOn the complexity of solving feasible systems of linear inequalities specified with approximate dataA remark on the smallest singular value of powers of Gaussian matricesCondition numbers for the cube. I: Univariate polynomials and hypersurfacesA smooth transition towards a Tracy–Widom distribution for the largest eigenvalue of interacting k-body fermionic embedded Gaussian ensemblesStochastic Rounding Variance and Probabilistic Bounds: A New ApproachSome properties of the proper values of a matrixApproximation of rectangular beta-Laguerre ensembles and large deviationsConditioning of linear systems arising from penalty methodsEl metodo del «simplex» de la programacion linealJohn von Neumann 1903-1957Von Neumann’s contributions to automata theoryComputational complexity of kernel-based density-ratio estimation: a condition number analysisComplex random matrices have no real eigenvaluesTowards classical hardness of module-LWE: the linear rank caseTrefftz approximations in complex media: accuracy and applicationsSome remarks on the condition number of a real random square matrixSeepage analysis in multi-domain general anisotropic media by three-dimensional boundary elementsFixed energy universality of Dyson Brownian motionOn round-off error in fixed-point multiplicationA Random Walk Through Experimental MathematicsOn the epistemological analysis of modeling and computational error in the mathematical sciencesProbabilistic Error Analysis for Inner ProductsFinite element exterior calculus: from Hodge theory to numerical stabilityRoundoff error analysis of fast DCT algorithms in fixed point arithmeticThe smallest singular value of a shifted $d$-regular random square matrixOn the probability distribution of data at points in real complete intersection varietiesUnnamed ItemCombining the unrestricted estimators into a single estimator and a simulation study on the unrestricted estimatorsUnnamed ItemInvertibility of sparse non-Hermitian matricesThe probability that a slightly perturbed numerical analysis problem is difficultUpper bounds on the distribution of the condition number of singular matricesProbabilistic analyses of condition numbersPractical aspects of interval computationA stochastic partial differential equation for computational algorithmsA matrix lower boundA THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFFAdversarial smoothed analysisSampling the eigenvalues of random orthogonal and unitary matricesHow ordinary elimination became Gaussian eliminationA Survey on the Eigenvalues Local Behavior of Large Complex Correlated Wishart MatricesRandom matrices: The distribution of the smallest singular valuesRoundoff error distribution in fixed point multiplicationUnnamed ItemAn upper bound on the smallest singular value of a square random matrixOn a condition number of general random polynomial systemsLarge complex correlated Wishart matrices: fluctuations and asymptotic independence at the edgesSharp transition of the invertibility of the adjacency matrices of sparse random graphsThe smallest singular value of inhomogeneous square random matricesComputing the homology of semialgebraic sets. I: Lax formulasApplication of the concept of the conditioning of a matrix to an identification problemOn block diagonal and Schur complement preconditioningA modern retrospective on probabilistic numericsOn local analysisSpectral statistics of non-selfadjoint operators subject to small random perturbationsAlgorithms in unnormalized arithmetic. III: Matrix inversionOutlier Eigenvalues for Deformed I.I.D. Random MatricesSolving linear algebraic equations can be interestingFifty years of Applications of MathematicsGeneration of errors in digital computationThe smallest singular value of heavy-tailed not necessarily i.i.d. random matrices via random roundingProbabilistic analysis of complex Gaussian elimination without pivotingA New Approach to Probabilistic Rounding Error AnalysisThe use of preconditioning in direct methods of solving positive definite linear systemsStatistical approach for highest precision numerical differentiationThe spectral condition number plot for regularization parameter evaluationThe probabilistic estimates on the largest and smallest $q$-singular values of random matricesMotivation for working in numerical analysisThe asymptotic distribution of the condition number for random circulant matricesA Modification of the Runge-Kutta Fourth-Order MethodReport on test matrices for generalized inversesOn the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined caseReal computations with fake numbersProbabilistic error analysis of Gaussian elimination in floating point and logarithmic arithmetic33 years of numerical instability. IUnnamed ItemRare events in random matrix theory




This page was built for publication: Numerical inverting of matrices of high order