A generalization of the steepest descent method for matrix functions.
A method for dealing with ill-conditioned symmetric linear systems
A note on Newbery's algorithm for discrete least-squares approximation by trigonometric polynomials.
A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search
The Alternating Nonnegative Least Squares (ANLS) method is commonly used for solving nonnegative tensor factorization problems. In this paper, we focus on algorithmic improvement of this method. We present a Proximal ANLS (PANLS) algorithm to enforce convergence. To speed up the PANLS method, we propose to combine it with a periodic enhanced line search strategy. The resulting algorithm, PANLS/PELS, converges to a critical point of the nonnegative tensor factorization problem under mild conditions....
Alcune osservazioni sul rango numerico per operatori non lineari
We discuss some numerical ranges for Lipschitz continuous nonlinear operators and their relations to spectral sets. In particular, we show that the spectrum defined by Kachurovskij (1969) for Lipschitz continuous operators is contained in the so-called polynomial hull of the numerical range introduced by Rhodius (1984).
Block matrix approximation via entropy loss function
The aim of the paper is to present a procedure for the approximation of a symmetric positive definite matrix by symmetric block partitioned matrices with structured off-diagonal blocks. The entropy loss function is chosen as approximation criterion. This procedure is applied in a simulation study of the statistical problem of covariance structure identification.
Computation of bifurcated branches in a free boundary problem arising in combustion theory
We consider a parabolic 2D Free Boundary Problem, with jump conditions at the interface. Its planar travelling-wave solutions are orbitally stable provided the bifurcation parameter does not exceed a critical value . The latter is the limit of a decreasing sequence of bifurcation points. The paper deals with the study of the 2D bifurcated branches from the planar branch, for small k. Our technique is based on the elimination of the unknown front, turning the problem into a fully nonlinear...
Computing the Ideal Structure of Finite Semigroups.
Error Estimates for Miller's Algorithm.
Evaluation de l'incertitude sur la solution d'un système Linéaire.
Iterationsverfahren und allgemeine Euler-Verfahren.
Laconicity and redundancy of Toeplitz matrices.
Métodos para la actualización de los factores de Q y R de una matriz.
Recientemente se han propuesto varios métodos para modificar los factores Q y R de una matriz una vez que se ha eliminado (o añadido) una fila o una columna. Normalmente la descripción de estos métodos se efectúa en el contexto de una determinada aplicación; quizá sea ésta la causa de su escasa difusión.
Nonsingularity and -matrices.
New proofs of two previously published theorems relating nonsingularity of interval matrices to -matrices are given.
On the Distribution of Errors in the Iterative Solution of a System of Linear Equations.
On the generalized Riccati matrix differential equation. Exact, approximate solutions and error estimate
In this paper explicit expressions for solutions of Cauchy problems and two-point boundary value problems concerned with the generalized Riccati matrix differential equation are given. These explicit expressions are computable in terms of the data and solutions of certain algebraic Riccati equations related to the problem. The interplay between the algebraic and the differential problems is used in order to obtain approximate solutions of the differential problem in terms of those of the algebraic...
Perturbation d'une matrice hermitienne ou normale.
Polynomial operations: Numerical performance in matrix diophantine equation
Relative bilinear complexity and matrix multiplication.
Replicant compression coding in Besov spaces
We present here a new proof of the theorem of Birman and Solomyak on the metric entropy of the unit ball of a Besov space on a regular domain of The result is: if s - d(1/π - 1/p)+> 0, then the Kolmogorov metric entropy satisfies H(ε) ~ ε-d/s. This proof takes advantage of the representation of such spaces on wavelet type bases and extends the result to more general spaces. The lower bound is a consequence of very simple probabilistic exponential inequalities. To prove the upper bound,...