The following pages link to Gianna M. Del Corso (Q237773):
Displaying 41 items.
- A condensed representation of almost normal matrices (Q389723) (← links)
- Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding (Q475676) (← links)
- Transformations to rank structures by unitary similarity (Q556881) (← links)
- A unification of unitary similarity transforms to compressed representations (Q652255) (← links)
- Evaluating scientific products by means of citation-based models: a first analysis and validation (Q836831) (← links)
- Rank structure of generalized inverses of rectangular banded matrices (Q862044) (← links)
- A combined approach for evaluating papers, authors and scientific journals (Q989120) (← links)
- (Q1043705) (redirect page) (← links)
- Versatile weighting strategies for a citation-based research evaluation model (Q1043706) (← links)
- (Q1300220) (redirect page) (← links)
- Finding exact solutions to the bandwidth minimization problem (Q1300222) (← links)
- On the randomized error of polynomial methods for eigenvector and eigenvalue estimates (Q1383440) (← links)
- Randomized error estimation for eigenvalue approximation (Q1570401) (← links)
- Inversion of two level circulant matrices over \(\mathbb{Z}_{p}\) (Q1874655) (← links)
- Randomization and the parallel solution of linear algebra problems (Q1905899) (← links)
- Matrix rank and communication complexity (Q1970502) (← links)
- Adaptive nonnegative matrix factorization and measure comparisons for recommender systems (Q2011084) (← links)
- Orthogonal iterations on companion-like pencils (Q2113645) (← links)
- Fast QR iterations for unitary plus low rank matrices (Q2288368) (← links)
- Counting Fiedler pencils with repetitions (Q2401305) (← links)
- Block tridiagonal reduction of perturbed normal and rank structured matrices (Q2435553) (← links)
- Comparison of Krylov subspace methods on the PageRank problem (Q2475363) (← links)
- Structural properties of matrix unitary reduction to semiseparable form (Q2504789) (← links)
- Inversion of circulant matrices over $\mathbf{Z}_m$ (Q2719071) (← links)
- Preconditioned edge-preserving image deblurring and denoising (Q2748184) (← links)
- An Implicit Multishift $QR$-Algorithm for Hermitian Plus Low Rank Matrices (Q2998029) (← links)
- qd-Type Methods for Quasiseparable Matrices (Q3112391) (← links)
- Factoring Block Fiedler Companion Matrices (Q3294688) (← links)
- (Q4219049) (← links)
- (Q4239644) (← links)
- Estimating an Eigenvector by the Power Method with a Random Start (Q4377492) (← links)
- (Q4536926) (← links)
- On computing the density of integers of the form $2^n+p$ (Q5113672) (← links)
- (Q5116767) (← links)
- Efficient Reduction of Compressed Unitary Plus Low Rank Matrices to Hessenberg Form (Q5146607) (← links)
- When is a matrix unitary or Hermitian plus low rank? (Q5206501) (← links)
- Algorithms and Models for the Web-Graph (Q5311164) (← links)
- Fast PageRank Computation via a Sparse Linear System (Q5474649) (← links)
- A CMV-Based Eigensolver for Companion Matrices (Q5502142) (← links)
- Heuristic spectral techniques for the reduction of bandwidth and work-bound of sparse matrices (Q5959245) (← links)
- Quantum clustering with \(k\)-means: a hybrid approach (Q6190010) (← links)
