Computing the square root and logarithm of real P-orthogonal matrix
Applied Numerical Mathematics
The solution of s exp(s) = a is not always the lambert w function of a
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
A Fast and Log-Euclidean Polyaffine Framework for Locally Linear Registration
Journal of Mathematical Imaging and Vision
Analog Integrated Circuits and Signal Processing
An algorithm to compute averages on matrix Lie groups
IEEE Transactions on Signal Processing
Brief paper: Pseudo-state feedback stabilization of commensurate fractional order systems
Automatica (Journal of IFAC)
Configuration products and quotients in geometric modeling
Computer-Aided Design
Steady affine motions and morphs
ACM Transactions on Graphics (TOG)
A log-euclidean polyaffine framework for locally rigid or affine registration
WBIR'06 Proceedings of the Third international conference on Biomedical Image Registration
Mathematical description of motion and deformation: from basics to graphics applications
SIGGRAPH Asia 2013 Courses
Lie-group interpolation and variational recovery for internal variables
Computational Mechanics
| Hi-index | 0.01 |
The standard inverse scaling and squaring algorithm for computing the matrix logarithm begins by transforming the matrix to Schur triangular form in order to facilitate subsequent matrix square root and Padé approximation computations. A transformation-free form of this method that exploits incomplete Denman--Beavers square root iterations and aims for a specified accuracy (ignoring roundoff) is presented. The error introduced by using approximate square roots is accounted for by a novel splitting lemma for logarithms of matrix products. The number of square root stages and the degree of the final Padé approximation are chosen to minimize the computational work. This new method is attractive for high-performance computation since it uses only the basic building blocks of matrix multiplication, LU factorization and matrix inversion.