Grazia Lotti

Orcid: 0000-0002-3299-1967

According to our database1, Grazia Lotti authored at least 38 papers between 1979 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Construction of the similarity matrix for the spectral clustering method: Numerical experiments.
J. Comput. Appl. Math., 2020

A Model for the Frequency Distribution of Multi-Scale Phenomena.
Inf., 2020

2019
Adaptive Clustering via Symmetric Nonnegative Matrix Factorization of the Similarity Matrix.
Algorithms, 2019

An Adaptive Procedure for the Global Minimization of a Class of Polynomial Functions.
Algorithms, 2019

2018
Image regularization by nonnegatively constrained Conjugate Gradient.
Appl. Math. Comput., 2018

2014
Generalized Cross-Validation applied to Conjugate Gradient for discrete ill-posed problems.
Appl. Math. Comput., 2014

2012
A Divide and Conquer Algorithm for the Superfast Solution of Toeplitz-like Systems.
SIAM J. Matrix Anal. Appl., 2012

2011
A Coupled Model for the Indegree and Outdegree Analysis of the Web.
Internet Math., 2011

2010
Stability of the Levinson Algorithm for Toeplitz-Like Systems.
SIAM J. Matrix Anal. Appl., 2010

2009
Recursive algorithms for unbalanced banded Toeplitz systems.
Numer. Linear Algebra Appl., 2009

2007
A note on the solution of not balanced banded Toeplitz systems.
Numer. Linear Algebra Appl., 2007

A Stochastic Model for the Link Analysis of the Web.
Internet Math., 2007

Regularizing Inverse Preconditioners for Symmetric Band Toeplitz Matrices.
EURASIP J. Adv. Signal Process., 2007

2004
Non-recursive solution of sparse block Hessenberg systems.
Numer. Linear Algebra Appl., 2004

Rounding Error Analysis in Solving <i>M</i>-Matrix Linear Systems of Block Hessenberg Form.
Numer. Algorithms, 2004

2003
Efficient and Stable Solution of M-Matrix Linear Systems of (Block) Hessenberg Form.
SIAM J. Matrix Anal. Appl., 2003

2002
Railway Computation for Infinite Linear Systems.
Int. J. Parallel Program., 2002

2000
Separable asymptotic cost of evaluating elementary functions.
Numer. Algorithms, 2000

1999
An infinite precision bracketing algorithm with guaranteed convergence.
Numer. Algorithms, 1999

1997
Local Error Estimates and Regularity Tests for the Implementation of Double Adaptive Quadrature.
ACM Trans. Math. Softw., 1997

Additive One-Dimensional Cellular Automata are Chaotic According to Devaney's Definition of Chaos.
Theor. Comput. Sci., 1997

1994
Asymptotic Behavior of Automatic Quadrature.
J. Complex., 1994

1992
The application of VLSI Poisson solvers to the biharmonic problem.
Parallel Comput., 1992

Fast Solution of Linear Systems with Polynomial Coefficients over the Ring of Integers.
J. Algorithms, 1992

1991
Algorithm 691: Improving QUADPACK automatic integration routines.
ACM Trans. Math. Softw., 1991

Interpolatory integration formulas for optimal composition.
ACM Trans. Math. Softw., 1991

VLSI implementation of the capacitance matrix method.
Integr., 1991

1990
Area-Time Trade-Offs for Matrix-Vector Multiplication.
J. Parallel Distributed Comput., 1990

1986
A VLSI Fast Solver for Tridiagonal Linear Systems.
Inf. Process. Lett., 1986

Area-Time Tradeoffs for Bilinear Forms Computations in VLSI.
Inf. Process. Lett., 1986

A Note on the VLSI Counter.
Inf. Process. Lett., 1986

1985
VLSI Implementation of Fast Solvers for Band Linear Systems With Constant Coefficient Matrix.
Inf. Process. Lett., 1985

VLSI implementation of iterative methods for the solution of linear systems.
Integr., 1985

1984
Area-Time Tradeoff for Rectangular Matrix Multiplication in VLSI Models.
Inf. Process. Lett., 1984

1983
On the Asymptotic Complexity of Rectangular Matrix Multiplication.
Theor. Comput. Sci., 1983

1980
Application of Approximating Algorithms to Boolean Matrix Multiplication.
IEEE Trans. Computers, 1980

Approximate Solutions for the Bilinear Form Computational Problem.
SIAM J. Comput., 1980

1979
O(n<sup>2.7799</sup>) Complexity for n*n Approximate Matrix Multiplication.
Inf. Process. Lett., 1979


  Loading...