English
Related papers

Related papers: A note on the error analysis of classical Gram-Sch…

200 papers

We consider solving the low rank matrix sensing problem with Factorized Gradient Descend (FGD) method when the true rank is unknown and over-specified, which we refer to as over-parameterized matrix sensing. If the ground truth signal…

Machine Learning · Computer Science 2021-02-05 Jiacheng Zhuo , Jeongyeol Kwon , Nhat Ho , Constantine Caramanis

A \emph{rational orthogonal matrix} $Q$ is an orthogonal matrix with rational entries, and $Q$ is called \emph{regular} if each of its row sum equals one, i.e., $Qe = e$ where $e$ is the all-one vector. This paper presents a method for…

Combinatorics · Mathematics 2024-10-16 Quanyu Tang , Wei Wang , Hao Zhang

Some new rigorous perturbation bounds for the generalized Cholesky factorization with normwise or componentwise perturbations in the given matrix are obtained, where the componentwise perturbation has the form of backward rounding error for…

Numerical Analysis · Mathematics 2014-09-23 Hanyu Li , Yanfei Yang

We study the problem of decomposition (non-commutative factorization) of linear ordinary differential operators near an irregular singular point. The solution (given in terms of the Newton diagram and the respective characteristic numbers)…

Classical Analysis and ODEs · Mathematics 2018-05-08 Leanne Mezuman , Sergei Yakovenko

We assume that every element of a matrix has a small, individual error, and model it by an external number, which is the sum of a nonstandard real number and a neutrix, the latter being a convex (external) set having the group property. The…

Rings and Algebras · Mathematics 2019-07-31 Nam van Tran , Imme van den Berg

We use methods of the general theory of congruence and *congruence for complex matrices--regularization and cosquares-to determine a unitary congruence canonical form (respectively, a unitary *congruence canonical form) for complex matrices…

Representation Theory · Mathematics 2012-12-14 Roger A. Horn , Vladimir V. Sergeichuk

This paper is concerned with the numerical analysis of linear and nonlinear Schr{\"o}dinger equations with analytic potentials. While the regularity of the potential (and the source term when there is one) automatically conveys to the…

Numerical Analysis · Mathematics 2023-12-21 Eric Cancès , Gaspard Kemlin , Antoine Levitt

In the paper Factorisation of division polynomials (H. Verdure, Proc. japan Academy, Ser A. 80 n. 5), Verdure gives the factorisation patterns of division polynomials of elliptic curves defined over a finite field. However, the result given…

Number Theory · Mathematics 2007-05-23 D. Sadornil

Following the works by Lin et al. (Circuits Syst. Signal Process. 20(6): 601-618, 2001) and Liu et al. (Circuits Syst. Signal Process. 30(3): 553-566, 2011), we investigate how to factorize a class of multivariate polynomial matrices. The…

Symbolic Computation · Computer Science 2019-05-29 Dong Lu , Dingkang Wang , Fanghui Xiao

The effects of imperfect gate operations in implementation of Shor's prime factorization algorithm are investigated. The gate imperfections may be classified into three categories: the systematic error, the random error, and the one with…

Quantum Physics · Physics 2007-05-23 Hao Guo , Gui-Lu Long , Yang Sun

The effects of imperfect gate operations in implementation of Shor's prime factorization algorithm are investigated. The gate imperfections may be classified into three categories: the systematic error, the random error, and the one with…

Quantum Physics · Physics 2007-05-23 Hao Guo , Gui Lu Long , Yang Sun

Gauss--Christoffel quadrature is a fundamental method for numerical integration, and its convergence analysis is closely related to the decay of Chebyshev expansion coefficients. Classical estimates, including those due to Trefethen, are…

Numerical Analysis · Mathematics 2025-12-30 Mehdi Hamzehnejad , Abbas Salemi

We study the renormalization of normal mixing matrices, which includes hermitian and unitary matrices as particular cases. We give a minimal, multiplicative parametrization of counterterms, and compute the renormalized Lagrangian to…

High Energy Physics - Phenomenology · Physics 2009-01-07 Antonio O. Bouzas

$ \newcommand{\cclass}[1]{{\textsf{#1}}} $The classical Grothendieck inequality has applications to the design of approximation algorithms for $\cclass{NP}$-hard optimization problems. We show that an algorithmic interpretation may also be…

Data Structures and Algorithms · Computer Science 2022-02-24 Assaf Naor , Oded Regev , Thomas Vidick

Approximate matrix factorization techniques with both nonnegativity and orthogonality constraints, referred to as orthogonal nonnegative matrix factorization (ONMF), have been recently introduced and shown to work remarkably well for…

Optimization and Control · Mathematics 2015-03-19 Filippo Pompili , Nicolas Gillis , P. -A. Absil , François Glineur

Let $\Delta(x)$ denote the error term in the Dirichlet divisor problem, and $E(T)$ the error term in the asymptotic formula for the mean square of $|\zeta(1/2+it)|$. If $E^*(t) = E(t) - 2\pi\Delta^*(t/2\pi)$ with $\Delta^*(x) = -\Delta(x) +…

Number Theory · Mathematics 2008-11-06 Aleksandar Ivic

Quantum Phase Estimation is a crucial component of several front-running quantum algorithms. Improving the efficiency and accuracy of QPE is currently a very active field of research. In this work, we present a hybrid quantum-classical…

Quantum Physics · Physics 2024-09-25 S. M. Lim , C. E. Susa , R. Cohen

We discuss a triangulated category of graded matrix factorizations of a deformed polynomial associated to the $A_{\mu}\textrm{-}$singularity. The semi-universal deformation of the $A_{\mu}\textrm{-}$singularity is given by a certain…

Algebraic Geometry · Mathematics 2026-05-18 Tomoya Nakatani

Using a new state-dependent, $\lambda$-deformable, linear functional operator, ${\cal Q}_{\psi}^{\lambda}$, which presents a natural $C^{\infty}$ deformation of quantization, we obtain a uniquely selected non--linear, integro--differential…

Quantum Physics · Physics 2013-01-01 K. R. W. Jones

Suppose that the collection $\{e_i\}_{i=1}^m$ forms a frame for $\R^k$, where each entry of the vector $e_i$ is a sub-Gaussian random variable. We consider expansions in such a frame, which are then quantized using a Sigma-Delta scheme. We…

Information Theory · Computer Science 2013-06-20 Felix Krahmer , Rayan Saab , Özgür Yılmaz