We consider the two logarithmic strain measures=||\mathrm dev _n\mathrm log U||=||\mathrm
dev _n\mathrm log F^ TF||\quad and\quad\vol=|\mathrm tr (\mathrm log U)=|\mathrm tr …

We investigate a family of isotropic volumetric-isochoric decoupled strain energies F ↦ W_
eH (F):= W _ eH (U):=\left {μ ke^ k ‖ dev _n U ‖^ 2+ κ 2 ke^ k tr (\log U)^ 2 & if\det F> …

The Schur--Padé algorithm NJ Higham and L. Lin, SIAM J. Matrix Anal. Appl., 32 (2011), pp.
1056--1078 computes arbitrary real powers A^t of a matrix A∈C^n*n using the building …

This short note provides an explicit description of the Fréchet derivatives of the principal
square root matrix function at any order. We present an original formulation that allows to …

Several existing algorithms for computing the matrix cosine employ polynomial or rational
approximations combined with scaling and use of a double angle formula. Their derivations …

Existing algorithms for computing the matrix cosine are tightly coupled to a specific precision
of floating-point arithmetic for optimal efficiency so they do not conveniently extend to an …

In this article, we propose two new iterative algorithms to solve the frequency-limited
Riemannian optimization model order reduction problems of linear and bilinear systems …

In the field of signal processing, the sampling theorem plays a fundamental role for signal
reconstruction as it bridges the gap between analog and digital signals. Following the …

Two algorithms are developed for computing the matrix logarithm in floating point arithmetic
of any specified precision. The backward error-based approach used in the state of the art …

We consider the blind source separation (BSS) problem and the closely related approximate
joint diagonalization (AJD) problem of symmetric positive definite (SPD) matrices. These two …