Publication | Date of Publication | Type |
---|
An adaptive procedure for the global minimization of a class of polynomial functions | 2020-10-07 | Paper |
Adaptive computation of the symmetric nonnegative matrix factorization (SymNMF) | 2020-07-07 | Paper |
Construction of the similarity matrix for the spectral clustering method: numerical experiments | 2020-03-30 | Paper |
Image regularization by nonnegatively constrained conjugate gradient | 2019-06-25 | Paper |
Generalized cross-validation applied to conjugate gradient for discrete ill-posed problems | 2016-04-29 | Paper |
An inner-outer regularizing method for ill-posed problems | 2014-12-05 | Paper |
Stopping rules for iterative methods in nonnegatively constrained deconvolution | 2014-04-30 | Paper |
A Divide and Conquer Algorithm for the Superfast Solution of Toeplitz-like Systems | 2013-04-23 | Paper |
A Coupled Model for the Indegree and Outdegree Analysis of the Web | 2012-05-22 | Paper |
Recursive algorithms for unbalanced banded Toeplitz systems | 2011-06-29 | Paper |
Stability of the Levinson Algorithm for Toeplitz-Like Systems | 2011-03-02 | Paper |
Performance analysis of maximum likelihood methods for regularization problems with nonnegativity constraints | 2010-09-06 | Paper |
Regularizing inverse preconditioners for symmetric band Toeplitz matrices | 2009-09-01 | Paper |
A note on the solution of not balanced banded Toeplitz systems | 2009-08-17 | Paper |
A Stochastic Model for the Link Analysis of the Web | 2008-08-19 | Paper |
Adaptive solution of infinite linear systems by Krylov subspace methods | 2008-03-11 | Paper |
Non‐recursive solution of sparse block Hessenberg systems | 2006-10-16 | Paper |
Preconditioners based on fit techniques for the iterative regularization in the image deconvolution problem | 2005-10-18 | Paper |
Rounding error analysis in solving \(M\)-matrix linear systems of block Hessenberg form | 2004-08-19 | Paper |
Efficient and Stable Solution of M-Matrix Linear Systems of (Block) Hessenberg Form | 2004-01-18 | Paper |
Railway computation for infinite linear systems | 2003-05-06 | Paper |
A polynomial fit preconditioner for band Toeplitz matrices in image reconstruction | 2002-06-24 | Paper |
Solution of infinite linear systems by automatic adaptive iterations | 2001-06-26 | Paper |
Separable asymptotic cost of evaluating elementary functions | 2000-11-22 | Paper |
An infinite precision bracketing algorithm with guaranteed convergence | 2000-09-07 | Paper |
Additive one-dimensional cellular automata are chaotic according to Devaney's definition of chaos | 1998-10-22 | Paper |
Interpolatory integration formulas for optimal composition | 1998-02-09 | Paper |
Algorithm 691: Improving QUADPACK automatic integration routines | 1998-02-09 | Paper |
Local error estimates and regularity tests for the implementation of double adaptive quadrature | 1998-01-07 | Paper |
New symmetric interpolatory quadrature formulas | 1997-10-19 | Paper |
Asymptotic behavior of automatic quadrature | 1996-03-14 | Paper |
Theoretical and practical efficiency measures for symmetric interpolatory quadrature formulas | 1995-11-06 | Paper |
Peano kernel behaviour and error bounds for symmetric quadrature formulas | 1995-04-20 | Paper |
Bounds on the error of Fejér and Clenshaw-Curtis type quadrature for analytic functions | 1994-06-23 | Paper |
Asymptotic expansion of error in interpolatory quadrature | 1993-02-22 | Paper |
Fast solution of linear systems with polynomial coefficients over the ring of integers | 1993-01-12 | Paper |
Generalized band matrices and their inverses | 1992-09-27 | Paper |
The application of VLSI Poisson solvers to the biharmonic problem | 1992-06-28 | Paper |
Testing automatic quadrature programs | 1992-06-26 | Paper |
Local error estimates in quadrature | 1991-01-01 | Paper |
Parallel algorithms for matrix polynomial division | 1991-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q5748803 | 1990-01-01 | Paper |
A fast algorithm for the division of two polynomial matrices | 1989-01-01 | Paper |
A parallel perturbed biharmonic solver | 1987-01-01 | Paper |
Area-time tradeoffs for bilinear forms computations in VLSI | 1986-01-01 | Paper |
A VLSI fast solver for tridiagonal linear systems | 1986-01-01 | Paper |
VLSI implementation of fast solvers for band linear systems with constant coefficient matrix | 1985-01-01 | Paper |
Area-time tradeoff for rectangular matrix multiplication in VLSI models | 1984-01-01 | Paper |
On the asymptotic complexity of rectangular matrix multiplication | 1983-01-01 | Paper |
Stability of fast algorithms for matrix multiplication | 1980-01-01 | Paper |
Approximate Solutions for the Bilinear Form Computational Problem | 1980-01-01 | Paper |
Application of Approximating Algorithms to Boolean Matrix Multiplication | 1980-01-01 | Paper |
\(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication | 1979-01-01 | Paper |