Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Gaussian Elimination: Problem Solving

Gaussian Elimination: Problem Solving

Systems of linear equations in several variables are pivotal in modeling complex scenarios involving multiple unknowns and constraints. Such systems are widely used in various fields to represent relationships where several conditions must be simultaneously satisfied. Each variable in the system corresponds to an unknown quantity, while each equation imposes a linear constraint, leading to a structured approach for analyzing and solving real-world problems.A system of three equations with three...

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

Vector Algebra: Method of Components

Vector Algebra: Method of Components

It is cumbersome to find the magnitudes of vectors using the parallelogram rule or using the graphical method to perform mathematical operations like addition, subtraction, and multiplication. There are two ways to circumvent this algebraic complexity. One way is to draw the vectors to scale, as in navigation, and read approximate vector lengths and angles (directions) from the graphs. The other way is to use the method of components.
In many applications, the magnitudes and directions of...

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for k_a Estimation

This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...

Extraction: Partition and Distribution Coefficients

Extraction: Partition and Distribution Coefficients

The distribution law or Nernst's distribution law is the law that governs the distribution of a solute between two immiscible solvents. This law, also known as the partition law, states that if a solute is added to the mixture of two immiscible solvents at a constant temperature, the solute is distributed between the two solvents in such a way that the ratio of solute concentrations in the solvents remains constant at equilibrium.
For extracting a solute from an aqueous phase into an organic...

Fast Decoupled and DC Powerflow

Fast Decoupled and DC Powerflow

The fast decoupled power flow method addresses contingencies in power system operations, such as generator outages or transmission line failures. This method provides quick power flow solutions, essential for real-time system adjustments. Fast decoupled power flow algorithms simplify the Jacobian matrix by neglecting certain elements, leading to two sets of decoupled equations:

You might also read

Related Articles

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

Sort by

Same author

Black Hole Spectroscopy and Tests of General Relativity with GW250114.

Physical review letters·2026

Same author

Identification of Dual Super-Response in Patients With Asthma and CRSwNP Treated With Mepolizumab.

Journal of investigational allergology & clinical immunology·2025

Same author

GW250114: Testing Hawking's Area Law and the Kerr Nature of Black Holes.

Physical review letters·2025

Same author

Population Genomics of <i>Macrophomina</i> spp. Reveals Cryptic Host Specialization and Evidence for Meiotic Recombination.

Molecular plant-microbe interactions : MPMI·2025

Same author

High-Statistics Measurement of Collins and Sivers Asymmetries for Transversely Polarized Deuterons.

Physical review letters·2024

Same author

Final COMPASS Results on the Transverse-Spin-Dependent Azimuthal Asymmetries in the Pion-Induced Drell-Yan Process.

Physical review letters·2024

Search research articles

Related Experiment Videos

Self-organizing algorithms for generalized eigen-decomposition.

C Chatterjee¹, V P Roychowdhury, J Ramos

¹GDE Syst. Inc., San Diego, CA.

IEEE Transactions on Neural Networks

|January 1, 1997

Summary

This study introduces new adaptive algorithms for generalized eigen-decomposition and linear discriminant analysis (LDA) using self-organization. These algorithms efficiently extract significant components and eigenvectors from data sequences.

Related Experiment Videos

Area of Science:

Artificial Intelligence
Machine Learning
Computational Neuroscience

Background:

Self-organization principles are crucial for developing adaptive algorithms.
Generalized eigen-decomposition and Linear Discriminant Analysis (LDA) are fundamental in data analysis and pattern recognition.

Purpose of the Study:

To develop novel adaptive algorithms for generalized eigen-decomposition and LDA.
To explore a new self-organization approach for these algorithms within a neural network framework.

Main Methods:

Derivation of iterative algorithms using a constrained least-mean-squared classification error cost function.
Utilizing a two-layer linear heteroassociative network for one-of-m classification.
Application of the deflation concept for sequential component extraction.

Main Results:

Two novel iterative algorithms for LDA and generalized eigen-decomposition were derived.
Sequential algorithms were developed to extract components and eigenvectors in decreasing order of significance.
Two new adaptive algorithms were introduced for computing principal generalized eigenvectors from random matrix sequences.

Conclusions:

The proposed self-organization approach yields effective adaptive algorithms for generalized eigen-decomposition and LDA.
Rigorous convergence analysis using stochastic approximation theory confirms algorithm convergence with probability one.