The University of Southampton
University of Southampton Institutional Repository

Low complexity matrix projections preserving actions on vectors

Low complexity matrix projections preserving actions on vectors
Low complexity matrix projections preserving actions on vectors

In this paper we prove that, given a n× n symmetric matrix A, a matrix V with r orthonormal columns and an integer m≥ 1 , mr≤ n, it is possible to devise a matrix algebra L such that, denoting by LA the matrix closest to A from L in the Frobenius norm, one has LAjV=AjV for j= 0 , ⋯ , m- 1. The algebra L is the space of all matrices that are diagonalized by a given orthogonal matrix L. We show, moreover, that L can be constructed as the product of mr Householder matrices, so that L, for mr≪ n, is a low complexity matrix algebra. The new theoretical results here introduced allow to investigate new possible preconditioners LA for the Conjugate Gradient method and new quasi-Newton algorithms suitable to solve large scale optimization problems.

Arnoldi method, Block-Krylov spaces, Direction preserving projections, Matrix projections, Unitary decomposition by householder matrices
0008-0624
Cipolla, Stefano
373fdd4b-520f-485c-b36d-f75ce33d4e05
Di Fiore, Carmine
f43c7f86-7a2e-474a-ad41-3ff3797128bc
Zellini, Paolo
ba2b701f-50cd-4b28-a91f-5bcd86484960
Cipolla, Stefano
373fdd4b-520f-485c-b36d-f75ce33d4e05
Di Fiore, Carmine
f43c7f86-7a2e-474a-ad41-3ff3797128bc
Zellini, Paolo
ba2b701f-50cd-4b28-a91f-5bcd86484960

Cipolla, Stefano, Di Fiore, Carmine and Zellini, Paolo (2019) Low complexity matrix projections preserving actions on vectors. Calcolo, 56 (2), [8]. (doi:10.1007/s10092-019-0305-8).

Record type: Article

Abstract

In this paper we prove that, given a n× n symmetric matrix A, a matrix V with r orthonormal columns and an integer m≥ 1 , mr≤ n, it is possible to devise a matrix algebra L such that, denoting by LA the matrix closest to A from L in the Frobenius norm, one has LAjV=AjV for j= 0 , ⋯ , m- 1. The algebra L is the space of all matrices that are diagonalized by a given orthogonal matrix L. We show, moreover, that L can be constructed as the product of mr Householder matrices, so that L, for mr≪ n, is a low complexity matrix algebra. The new theoretical results here introduced allow to investigate new possible preconditioners LA for the Conjugate Gradient method and new quasi-Newton algorithms suitable to solve large scale optimization problems.

Text
s10092-019-0305-8 - Version of Record
Restricted to Repository staff only
Request a copy

More information

Accepted/In Press date: 9 March 2019
e-pub ahead of print date: 19 March 2019
Additional Information: Funding Information: C.D.F. was partially supported by MIUR Excellence Department Project awarded to the Department of Mathematics, University of Rome Tor Vergata, CUP E83C18000100006.
Keywords: Arnoldi method, Block-Krylov spaces, Direction preserving projections, Matrix projections, Unitary decomposition by householder matrices

Identifiers

Local EPrints ID: 485539
URI: http://eprints.soton.ac.uk/id/eprint/485539
ISSN: 0008-0624
PURE UUID: 6754f75b-5acc-4ef3-b1c7-539a627b8e71
ORCID for Stefano Cipolla: ORCID iD orcid.org/0000-0002-8000-4719

Catalogue record

Date deposited: 08 Dec 2023 17:43
Last modified: 18 Mar 2024 04:17

Export record

Altmetrics

Contributors

Author: Stefano Cipolla ORCID iD
Author: Carmine Di Fiore
Author: Paolo Zellini

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×