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

Linearization and Approximation01:26

Linearization and Approximation

Linearization is a mathematical technique used to approximate complex, nonlinear functions with simpler linear models in the vicinity of a chosen reference point. The method is based on the idea that, although a function may be difficult to evaluate exactly, its behavior near a specific input value can often be closely approximated by the tangent line at that point. This approach is particularly useful when small deviations from a known value are involved.Consider the square root function, for...
Gaussian Elimination: Problem Solving01:30

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...
Application of Linearization and Approximation01:29

Application of Linearization and Approximation

A drone flying through complex terrain often relies on more than one sensing method to estimate small changes in altitude. Along with direct measurements, air pressure provides a useful indirect indicator of vertical movement. Atmospheric pressure decreases as altitude increases, and this relationship is commonly described using an exponential model. Although accurate, converting pressure measurements into altitude values requires calculations that are too complex to perform repeatedly during...
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length, the...
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.
Linear Approximations01:23

Linear Approximations

For a differentiable function of two variables, linear approximation estimates values near a known point by replacing the curved surface with its tangent plane. Consider the function\begin{equation*}f(x,y)=x^2+3y^2\end{equation*}near the point (2, 1). The exact value at this point is f(2, 1) = 22 + 3(1)2 = 4 + 3 = 7.The linear approximation of f(x, y)) near (a, b) is\begin{equation*}L(x,y)=f(a,b)+f_x(a,b)(x-a)+f_y(a,b)(y-b)\end{equation*}First, compute the partial derivatives: fx(x, y) = 2x and...

You might also read

Related Articles

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

Sort by
Same author

An Efficient Regenerated Cross-Modal Hashing: Improving Existing Hash Codes with the Arbitrary Length.

IEEE transactions on pattern analysis and machine intelligence·2026
Same author

Adapting Domain-Aware Knowledge to Vision-Language Model for Zero-Shot Anomaly Detection.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same author

Predefined-Time Dynamic Self-Triggered Approximate Optimal Control of Autonomous Surface Vehicles With Disturbances.

IEEE transactions on cybernetics·2025
Same author

RaLo: Rank-aware low-rank adaptation for pre-trained foundation models.

Neural networks : the official journal of the International Neural Network Society·2025
Same author

Central similarity joint-learning for cross-domain retrieval.

Neural networks : the official journal of the International Neural Network Society·2025
Same author

Multi-view subspace tensorization with attentive clustering embedding.

Neural networks : the official journal of the International Neural Network Society·2025
Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013
Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011
Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011
Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011
Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011
Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011
See all related articles

Related Experiment Video

Updated: Jun 20, 2026

Automated Joint Space Detection Improves Bone Segmentation Accuracy
06:45

Automated Joint Space Detection Improves Bone Segmentation Accuracy

Published on: November 28, 2025

Nonorthogonal approximate joint diagonalization with well-conditioned diagonalizers.

Guoxu Zhou1, Shengli Xie, Zuyuan Yang

  • 1South China University of Technology, Guangzhou 510641, China. zhou.guoxu@mail.scut.edu.cn

IEEE Transactions on Neural Networks
|September 25, 2009
PubMed
Summary
This summary is machine-generated.

This study introduces a novel nonorthogonal joint diagonalization algorithm that minimizes errors and condition numbers, avoiding degenerate solutions. The method is broadly applicable, including for blind source separation with ill-conditioned matrices.

Related Experiment Videos

Last Updated: Jun 20, 2026

Automated Joint Space Detection Improves Bone Segmentation Accuracy
06:45

Automated Joint Space Detection Improves Bone Segmentation Accuracy

Published on: November 28, 2025

Area of Science:

  • Linear Algebra
  • Optimization Theory
  • Signal Processing

Background:

  • Existing joint diagonalization algorithms often require restrictive constraints on diagonalizers.
  • These constraints can be uniformly addressed by minimizing the condition number of diagonalizers.

Purpose of the Study:

  • To develop a new algorithm for nonorthogonal joint diagonalization.
  • To address the approximate joint diagonalization problem as a multiobjective optimization problem.
  • To yield diagonalizers that minimize diagonalization error and condition number while avoiding degenerate solutions.

Main Methods:

  • Formulating approximate joint diagonalization as a multiobjective optimization problem.
  • Developing a novel algorithm for nonorthogonal joint diagonalization.
  • Analyzing convergence properties and uniqueness of solutions.

Main Results:

  • The new algorithm minimizes both diagonalization error and condition number.
  • Degenerate solutions are strictly avoided.
  • The algorithm demonstrates wide applicability with few restrictions on matrix sets.
  • Numerical simulations confirm performance and superiority over existing methods.

Conclusions:

  • The developed algorithm offers a robust approach to nonorthogonal joint diagonalization.
  • It provides significant advantages for applications like blind source separation, particularly with ill-conditioned matrices.