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

Long Division of Polynomials

Long Division of Polynomials

Polynomial division is an essential algebraic process to simplify expressions and solve equations. Just as numerical division separates a number into quotient and remainder, polynomial long division partitions a polynomial into simpler components; in this context, the dividend is the polynomial being divided, the divisor is the expression dividing it, and the result is expressed in terms of a quotient and a remainder.The division begins by arranging the dividend and divisor in standard...

Synthetic Disvision of Polynomials

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...

Fast Fourier Transform

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...

Real Zeros of Polynomials

Real 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...

Introduction to Polynomial Functions

Introduction 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...

Phasor Arithmetics

Phasor Arithmetics

Phasors and their corresponding sinusoids are interrelated, offering unique insights into the behavior of alternating current (AC) circuits. One way to understand this relationship is through the operations of differentiation and integration in both the time and phasor domains.
When the derivative of a sinusoid is taken in the time domain, it transforms into its corresponding phasor multiplied by j-omega (jω) in the phasor domain, where j is the imaginary unit, and ω is the angular...

You might also read

Related Articles

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

Sort by

Same author

Comparative Molecular Effects of Dexmedetomidine and Propofol on Osteoblast Migration and Osteogenic Gene Expression at Pediatric-Equivalent Concentrations: An In Vitro Study.

Current issues in molecular biology·2026

Same author

Association between temporomandibular disorders and sleep quality among undergraduate dental students: a cross-sectional study.

BMC oral health·2026

Same author

Accuracy, quality, and readability analyses of responses from large language models to questions on pediatric dental sedation.

BMC oral health·2026

Same author

Evaluation of postoperative bleeding and pain following tooth extraction in patients using direct oral anticoagulants: a prospective case-control study with blinded evaluation.

BMC oral health·2025

Same author

Freeform optics: introduction.

Optics express·2022

Same author

Quantitative assessment of human donor corneal endothelium with Gabor domain optical coherence microscopy.

Journal of biomedical optics·2019

Search research articles

Related Experiment Video

Updated: May 3, 2026

Lens-free Video Microscopy for the Dynamic and Quantitative Analysis of Adherent Cell Culture

Lens-free Video Microscopy for the Dynamic and Quantitative Analysis of Adherent Cell Culture

Published on: February 23, 2018

Acceleration of computation of φ-polynomials.

Ilhan Kaya, Jannick Rolland

|February 12, 2014

Summary

Parallel algorithms for computing φ-polynomials on multi-core platforms significantly accelerate calculations. This approach offers over tenfold computational speedup compared to sequential methods, enhancing freeform surface descriptions.

Area of Science:

Computational geometry and optics
Parallel computing and algorithm design

Background:

Freeform surfaces are complex to describe mathematically.
φ-polynomials are essential for accurately representing these surfaces.
Efficient computation of these polynomials is crucial for practical applications.

Purpose of the Study:

To investigate the computational benefits of multi-core platforms for φ-polynomial calculation.
To develop and implement parallel algorithms for Zernike and Q-polynomials.
To assess the performance improvement over sequential computation methods.

Main Methods:

Devised parallel algorithms leveraging recurrence relations for Zernike and gradient orthogonal Q-polynomials.
Implemented these algorithms on Graphical Processing Units (GPUs).

More Related Videos

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

Related Experiment Videos

Last Updated: May 3, 2026

Lens-free Video Microscopy for the Dynamic and Quantitative Analysis of Adherent Cell Culture

Lens-free Video Microscopy for the Dynamic and Quantitative Analysis of Adherent Cell Culture

Published on: February 23, 2018

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

Compared computational time against traditional sequential implementations.

Main Results:

Achieved significant speedups in φ-polynomial computation using parallel algorithms.
Demonstrated an order of magnitude improvement in computational time.
Validated the effectiveness of GPU acceleration for these specific polynomial calculations.

Conclusions:

Parallel algorithms based on recurrence relations are highly effective for computing φ-polynomials.
Multi-core platforms, particularly GPUs, offer substantial computational advantages.
This approach enhances the efficiency of freeform surface description in scientific and engineering fields.