Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Inverse z-Transform by Partial Fraction Expansion01:20

Inverse z-Transform by Partial Fraction Expansion

The inverse z-transform is a crucial technique for converting a function from its z-domain representation back to the time domain. One effective method for finding the inverse z-transform is the Partial Fraction Method, which involves decomposing a function into simpler fractions with distinct coefficients. These fractions correspond to known z-transform pairs, facilitating the inverse transformation process.
To begin the process, the poles of the function are identified and the function is...
Partial Fractions01:28

Partial Fractions

A partial fraction is a component of a rational expression represented as the sum of simpler fractions. When a rational function is expressed as a ratio of two polynomials, it can often be decomposed into a sum of fractions whose denominators are simpler polynomials, typically linear or irreducible quadratic factors. This process is called partial fraction decomposition, and it is used to simplify complex expressions for integration, solving equations, or analysis.Partial fraction decomposition...
Complex Zeros01:29

Complex Zeros

Complex zeros are the solutions to polynomial equations that include imaginary numbers, specifically, numbers of the form a + bi, where a and b are real numbers and i is the imaginary unit defined by i2=-1. These zeros satisfy the equation P(x) = 0, where P(x) is a polynomial with real or complex coefficients. Since the complex number system includes all real numbers, it provides a complete framework for analyzing all possible roots of a polynomial.Every polynomial of degree n≥1 can be...
Fundamental Theorem of Algebra01:30

Fundamental Theorem of Algebra

The Fundamental Theorem of Algebra is central to the study of polynomial equations, asserting that every non-constant polynomial with complex coefficients has at least one complex zero. This means that a polynomial of degree n ≥ 1, written as:  with an ≠ 0, has at least one solution in the complex number system. Since the set of real numbers is a subset of complex numbers, this theorem applies equally to polynomials with real coefficients.Building on this result, the Complete Factorization...
Synthetic Disvision of Polynomials01:28

Synthetic Disvision of Polynomials

Synthetic division is an efficient algorithmic approach for dividing a polynomial by a linear binomial of the form x - c, where c is a real number. This method is helpful due to its streamlined process, which avoids the more cumbersome steps involved in the traditional long division of polynomials. It simplifies computation and serves as a practical tool for evaluating polynomials and identifying their factors.To perform synthetic division, one begins by listing the coefficients of the...
Compacting Factor test01:22

Compacting Factor test

The compacting factor test is a method used to assess the workability of concrete. It is  especially suitable for concrete mixes containing aggregates up to one and a half inches in size. This test involves specialized equipment consisting of two truncated cone-shaped hoppers and a cylinder, all with polished interior surfaces to minimize friction.
The procedure begins by placing concrete into the upper hopper without any compaction. Once filled, the bottom door of this hopper is opened,...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Enhancing Molecular Dipole Moment Prediction with Multitask Machine Learning.

The journal of physical chemistry letters·2026
Same author

Shadow excited state molecular dynamics with the ΔSCF method.

The Journal of chemical physics·2026
Same author

High-Performance Semiempirical Excited-State Molecular Dynamics Powered by Graphics Processing Units.

The journal of physical chemistry letters·2026
Same author

Shadow molecular dynamics for flexible multipole models.

The Journal of chemical physics·2026
Same author

Ground and excited state gradients with end-to-end differentiable semiempirical quantum chemistry.

The Journal of chemical physics·2026
Same author

GPU-Accelerated Graph-Based Semiempirical Quantum Chemistry.

Journal of chemical theory and computation·2025

Related Experiment Video

Updated: Jul 6, 2026

Structure of HIV-1 Capsid Assemblies by Cryo-electron Microscopy and Iterative Helical Real-space Reconstruction
12:38

Structure of HIV-1 Capsid Assemblies by Cryo-electron Microscopy and Iterative Helical Real-space Reconstruction

Published on: August 9, 2011

Recursive inverse factorization.

Emanuel H Rubensson1, Nicolas Bock, Erik Holmström

  • 1Department of Theoretical Chemistry, School of Biotechnology, Royal Institute of Technology, Stockholm, Sweden. emanuel@theochem.kth.se

The Journal of Chemical Physics
|March 19, 2008
PubMed
Summary

A new recursive algorithm efficiently computes the inverse factorization of Hermitian positive definite matrices. This method, leveraging network theory and iterative refinement, offers linear computational scaling for sparse matrices.

Related Experiment Videos

Last Updated: Jul 6, 2026

Structure of HIV-1 Capsid Assemblies by Cryo-electron Microscopy and Iterative Helical Real-space Reconstruction
12:38

Structure of HIV-1 Capsid Assemblies by Cryo-electron Microscopy and Iterative Helical Real-space Reconstruction

Published on: August 9, 2011

Area of Science:

  • Computational physics
  • Linear algebra
  • Materials science

Background:

  • Hermitian positive definite matrices are crucial in quantum mechanics and solid-state physics.
  • Efficiently computing their inverse factorization is computationally demanding.
  • Existing methods may not scale well for large, complex systems.

Purpose of the Study:

  • To develop a novel recursive algorithm for the inverse factorization of Hermitian positive definite matrices.
  • To improve computational efficiency and scalability, particularly for sparse matrices.
  • To apply the algorithm to practical problems in computational chemistry and physics.

Main Methods:

  • A recursive algorithm based on iterative refinement and matrix decomposition.
  • Utilizing advances in network theory for optimal matrix partitioning.
  • Applying the algorithm to overlap matrices of three-dimensional molecular systems.

Main Results:

  • The proposed algorithm achieves inverse factorization S(-1)=ZZ(*) for Hermitian positive definite matrices.
  • Computational effort scales linearly with system size for sparse matrices.
  • Optimization of network modularity enhances matrix partitioning compared to other methods.

Conclusions:

  • The recursive inverse factorization algorithm provides an efficient and scalable solution.
  • The method demonstrates particular effectiveness for irregularly structured three-dimensional molecules.
  • This approach has significant implications for large-scale simulations in computational science.