Efficient computational method for matrix function in dynamic problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5674173 (Why is no real title available?)
- scientific article; zbMATH DE number 3602632 (Why is no real title available?)
- A Block Algorithm for Matrix 1-Norm Estimation, with an Application to 1-Norm Pseudospectra
- A family of embedded Runge-Kutta formulae
- A matrix iteration for dynamic network summaries
- A new scaling and squaring algorithm for the matrix exponential
- Accuracy and Stability of Numerical Algorithms
- Accurate matrix exponential computation to solve coupled differential models in engineering
- Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions
- Decay bounds and \(O(n)\) algorithms for approximating functions of sparse matrices
- Decay properties for functions of matrices over \(C^\ast\)-algebras
- Dynamic tensile and failure behavior of bi-directional reinforced GFRP materials
- Fluid-structure interaction in Z-shaped pipe with different supports
- Functions of Matrices
- High-performance computation of the exponential of a large sparse matrix
- Localization in matrix computations: theory and applications
- Network properties revealed through matrix functions
- Nineteen Dubious Ways to Compute the Exponential of a Matrix
- On precise integration method.
- On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
- Sparse approximate multifrontal factorization with butterfly compression for high-frequency wave equations
- Sparse approximations with interior point methods
- Symplectic transformation based analytical and numerical methods for linear quadratic control with hard terminal constraints
- The stochastic central difference method in structural dynamics
This page was built for publication: Efficient computational method for matrix function in dynamic problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6998815)
