Related Experiment Video
Updated: Jul 18, 2026
13:44
Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
Nonrecursive determination of orthonormal polynomials with matrix formulation.
Guang-Ming Dai1, Virendra N Mahajan
1AMO Laser Vision Correction Group, Santa Clara, California 95051, USA. george.dai@amo-inc.com
Optics Letters
|December 15, 2006
Summary
A new matrix-based method rapidly determines orthonormal polynomials over complex domains like hexagons. This non-recursive approach improves upon traditional methods for computational efficiency.
Area of Science:
- Mathematics
- Numerical Analysis
- Computational Geometry
Background:
- Orthonormal polynomials are crucial in various scientific fields.
- Traditional methods like Gram-Schmidt can be computationally intensive and recursive.
- Efficient determination of polynomials over non-standard domains is needed.
Purpose of the Study:
- To develop a general, non-recursive theoretical approach for determining orthonormal polynomials.
- To demonstrate the efficacy of this approach using hexagonal domains.
Main Methods:
- A novel theoretical framework utilizing matrix transformations.
- Application of the matrix approach to derive orthonormal hexagonal polynomials.
Main Results:
- A generalized, non-recursive method for orthonormal polynomial determination.
- Successful computation of orthonormal hexagonal polynomials as a case study.
Conclusions:
- The developed matrix approach offers a more efficient and rapid alternative to classical methods.
- This method is applicable to any integrable domain, enhancing computational mathematics.
Related Concept Videos
01:19Routh-Hurwitz Criterion II
In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first column of the Routh...
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first column of the Routh...
01:30Fundamental 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...
01:27Real Zeros of Polynomials
Polynomials are algebraic expressions of terms with variables raised to non-negative integer powers. A central aspect of analyzing polynomial functions is determining their real zeros—values of the variable for which the polynomial evaluates to zero. These values represent the x-intercepts of the polynomial’s graph.The Rational Zeros Theorem lists possible rational solutions for a polynomial equation with integer coefficients. If f(x)=anxn+....+a0, then every rational zero is of the form p/q,...
01:26Introduction to Polynomial Functions
Polynomial functions are fundamental elements in algebra and calculus, defined by expressions that combine variables and constants through addition, subtraction, and multiplication, with the variable raised to nonnegative integer exponents. A general polynomial function of degree n is given byWhere an ≠ 0. The term anxn is the leading term, and an is the leading coefficient, while a0 is referred to as the constant term.Characteristics and ClassificationPolynomials are categorized by their...
01:30Gaussian 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...
01:29Complex 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...