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