The following pages link to Dianne P. O'Leary (Q182673):
Displaying 50 items.
- Designing Optimal Spectral Filters for Inverse Problems (Q3116478) (← links)
- Windowed Spectral Regularization of Inverse Problems (Q3116480) (← links)
- (Q3125511) (← links)
- Deblurring Images (Q3432846) (← links)
- Stable Factorizations of Symmetric Tridiagonal and Triadic Matrices (Q3435012) (← links)
- Time reversal and n-qubit canonical decompositions (Q3438447) (← links)
- Near-Optimal Spectral Filtering and Error Estimation for Solving Ill-Posed Problems (Q3457834) (← links)
- Robust Regression Computation Using Iteratively Reweighted Least Squares (Q3484265) (← links)
- Residual periodograms for choosing regularization parameters for ill-posed problems (Q3507909) (← links)
- (Q3522587) (← links)
- (Q3531414) (← links)
- (Q3633951) (← links)
- Ordering Schemes for Parallel Processing of Certain Mesh Problems (Q3707294) (← links)
- Confidence Intervals for Inequality-Constrained Least Squares Problems, with Applications to Ill-Posed Problems (Q3723662) (← links)
- (Q3727305) (← links)
- Data-flow algorithms for parallel matrix computation (Q3745172) (← links)
- Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976 (Q3827469) (← links)
- Estimating the Largest Eigenvalue of a Positive Definite Matrix (Q3875207) (← links)
- Estimating Matrix Condition Numbers (Q3890007) (← links)
- Algorithm 572: Solution of the Helmholtz Equation for the Dirichlet Problem on General Bounded Three-Dimensional Regions [D3] (Q3903996) (← links)
- A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems (Q3923556) (← links)
- A discrete Newton algorithm for minimizing a function of many variables (Q3934149) (← links)
- Constrained Matrix Sylvester Equations (Q3988970) (← links)
- Design of reduced-order observers with precise loop transfer recovery (Q4015368) (← links)
- (Q4113356) (← links)
- (Q4194391) (← links)
- Capacitance Matrix Methods for the Helmholtz Equation on General Three-Dimensional Regions (Q4194392) (← links)
- BFGS with Update Skipping and Varying Memory (Q4229463) (← links)
- (Q4247215) (← links)
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems (Q4277780) (← links)
- (Q4281298) (← links)
- (Q4309404) (← links)
- (Q4327458) (← links)
- (Q4327487) (← links)
- (Q4353198) (← links)
- Regularization by Truncated Total Least Squares (Q4376214) (← links)
- Overcoming Instability In Computing The Fundamental Matrix For A Markov Chain (Q4389090) (← links)
- Restoring Images Degraded by Spatially Variant Blur (Q4389283) (← links)
- Blind Deconvolution Using a Regularized Structured Total Least Norm Algorithm (Q4443787) (← links)
- Tikhonov Regularization and Total Least Squares (Q4702259) (← links)
- Pivoted Cauchy-Like Preconditioners for Regularized Solution of Ill-Posed Problems (Q4702373) (← links)
- Why Broyden’s Nonsymmetric Method Terminates on Linear Equations (Q4838953) (← links)
- (Q4841342) (← links)
- A Block-GTH Algorithm for Finding the Stationary Vector of a Markov Chain (Q4891692) (← links)
- A Polynomial-Time Interior-Point Method for Conic Optimization, With Inexact Barrier Evaluations (Q5189572) (← links)
- Euclidean distance matrix completion problems (Q5200557) (← links)
- A Framework for Regularization via Operator Approximation (Q5254474) (← links)
- (Q5687211) (← links)
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming (Q5934414) (← links)
- Auditing and debugging deep learning models via flip points: individual-level and group-level analysis (Q6664405) (← links)
