Invertibility of random fredholm operators

DOI10.1080/07362999008809197zbMath0701.60061OpenAlexW2124658589MaRDI QIDQ3479323

Stefan Heinrich

Publication date: 1990

Published in: Stochastic Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/07362999008809197

zbMATH Keywords

random matricesdistribution of the normrandom Fredholm operatorWiener type measure

Mathematics Subject Classification ID

Probability measures on topological spaces (60B05) Random operators and equations (aspects of stochastic analysis) (60H25) General theory of linear operators (47A99) Probability theory on linear topological spaces (60B11)

Related Items

Condition numbers of random matrices, Corrections to Probabilistic analysis of numerical methods for integral equations, Lower bounds for the complexity of Monte Carlo function approximation, Probabilistic complexity analysis for linear problems in bounded domains, Probabilistic analysis of numerical methods for integral equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Average case optimal algorithms in Hilbert spaces
• Approximation of linear functionals on a Banach space with a Gaussian measure
• Average condition number for solving linear equations
• Optimal algorithms for linear problems with Gaussian measures
• Complexity theory of numerical linear algebra
• Some inequalities for Gaussian processes and applications
• Gaussian measures in Banach spaces
• Gaussian characterizations of certain Banach spaces
• Approximation of linear operators on a Wiener space
• Sample functions of the \(N\)-parameter Wiener process
• Random integral equations with applications to life sciences and engineering
• On seminorms and probabilities, and abstract Wiener spaces
• On bases, finite dimensional decompositions and weaker structures in Banach spaces
• Gaussian measure in Hilbert space and applications in numerical analysis
• On the average number of steps of the simplex method of linear programming
• On the efficiency of algorithms of analysis
• Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average
• Weak convergence of approximate solutions of stochastic equations with applications to random differential and integral equations^∗
• Eigenvalues and Condition Numbers of Random Matrices
• The fundamental theorem of algebra and complexity theory
• The Average number of pivot steps required by the Simplex-Method is polynomial