The following pages link to Lothar Reichel (Q403088):
Displaying 50 items.
- Computation of error bounds via generalized Gauss-Radau and Gauss-Lobatto rules (Q2029681) (← links)
- Corrigendum to: ``Comparison of a-posteriori parameter choice rules for linear discrete ill-posed problems'' (Q2033072) (← links)
- Linearized Krylov subspace Bregman iteration with nonnegativity constraint (Q2035517) (← links)
- Shifted extended global Lanczos processes for trace estimation with application to network analysis (Q2035644) (← links)
- Internality of generalized averaged Gauss quadrature rules and truncated variants for modified Chebyshev measures of the first kind (Q2043197) (← links)
- Communication in complex networks (Q2058396) (← links)
- Tensor Arnoldi-Tikhonov and GMRES-type methods for ill-posed problems with a t-product structure (Q2063214) (← links)
- The extended symmetric block Lanczos method for matrix-valued Gauss-type quadrature rules (Q2075961) (← links)
- A comparison of parameter choice rules for \(\ell^p\)-\(\ell^q\) minimization (Q2084586) (← links)
- A method for computing a few eigenpairs of large generalized eigenvalue problems (Q2085682) (← links)
- Krylov subspace split Bregman methods (Q2106230) (← links)
- Theoretical and numerical aspects of a non-stationary preconditioned iterative method for linear discrete ill-posed problems (Q2112676) (← links)
- Averaged Gauss quadrature formulas: properties and applications (Q2122056) (← links)
- Weighted tensor Golub-Kahan-Tikhonov-type methods applied to image processing using a t-product (Q2161047) (← links)
- Large-scale regression with non-convex loss and penalty (Q2192647) (← links)
- The extended global Lanczos method, Gauss-Radau quadrature, and matrix function approximation (Q2195917) (← links)
- Lanczos-based fast blind deconvolution methods (Q2196034) (← links)
- Functions and eigenvectors of partially known matrices with applications to network analysis (Q2227656) (← links)
- Estimating the error in matrix function approximations (Q2230689) (← links)
- Block matrix models for dynamic networks (Q2242768) (← links)
- Analysis of directed networks via partial singular value decomposition and Gauss quadrature (Q2249727) (← links)
- Simplified GSVD computations for the solution of linear discrete ill-posed problems (Q2252680) (← links)
- Square smoothing regularization matrices with accurate boundary conditions (Q2253081) (← links)
- Edge importance in a network via line graphs and the matrix exponential (Q2290932) (← links)
- A novel iterative method for discrete Helmholtz decomposition (Q2301390) (← links)
- Iterative Tikhonov regularization of tensor equations based on the Arnoldi process and some of its generalizations (Q2301408) (← links)
- An \(\ell^p\)-\(\ell^q\) minimization method with cross-validation for the restoration of impulse noise contaminated images (Q2309287) (← links)
- Arnoldi decomposition, GMRES, and preconditioning for linear discrete ill-posed problems (Q2311788) (← links)
- Internality of generalized averaged Gaussian quadrature rules and truncated variants for measures induced by Chebyshev polynomials (Q2311793) (← links)
- Generalized block anti-Gauss quadrature rules (Q2334059) (← links)
- Numerical aspects of the nonstationary modified linearized Bregman algorithm (Q2335665) (← links)
- Generalized anti-Gauss quadrature rules (Q2341340) (← links)
- On the computation of Gauss quadrature rules for measures with a monomial denominator (Q2345682) (← links)
- Bounding matrix functionals via partial global block Lanczos decomposition (Q2347487) (← links)
- Lavrentiev-type regularization methods for Hermitian problems (Q2355299) (← links)
- Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration (Q2359752) (← links)
- On the computation of a truncated SVD of a large linear discrete ill-posed problem (Q2360674) (← links)
- Circulant preconditioners for discrete ill-posed Toeplitz systems (Q2360680) (← links)
- Fractional Tikhonov regularization with a nonlinear penalty term (Q2360714) (← links)
- An implicitly restarted block Lanczos bidiagonalization method using Leja shifts (Q2376857) (← links)
- On the choice of subspace for large-scale Tikhonov regularization problems in general form (Q2414696) (← links)
- Fast factorization of rectangular Vandermonde matrices with Chebyshev nodes (Q2420156) (← links)
- Analysis of directed networks via the matrix exponential (Q2423601) (← links)
- Alternating Krylov subspace image restoration methods (Q2428120) (← links)
- A generalized global Arnoldi method for ill-posed matrix equations (Q2428122) (← links)
- Combining approximate solutions for linear discrete ill-posed problems (Q2428133) (← links)
- An iterative Lavrentiev regularization method (Q2433872) (← links)
- Fast computation of convolution operations via low-rank approximation (Q2448383) (← links)
- FGMRES for linear discrete ill-posed problems (Q2448386) (← links)
- A note on superoptimal generalized circulant preconditioners (Q2448387) (← links)
