Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Polynomial Division & Observer/Controller Approach
Graph Chatbot
Related lectures (30)
Polynomial Methods: GCD Calculation Summary
Covers the calculation of the greatest common divisor using polynomial methods and the Euclidean algorithm.
Euclidean Algorithm
Explains the Euclidean algorithm for polynomials over a field K, illustrating its application with examples.
Ideals: Polynomials and Definitions
Explores ideals in K[X], including PGCD, uniqueness, coprimality, and theorems of Bézout and Gauss.
Polynomials: Roots and Factorization
Explores polynomial roots, factorization, and the Euclidean algorithm in depth.
Polynomial Factorization: Field Approach
Covers the factorization of polynomials over a field, including division with remainder and common divisors.
Polynomial Factorization over Finite Fields
Introduces polynomial factorization over finite fields and efficient computation of greatest common divisors of polynomials.
Minimal Polynomials: Uniqueness and Division
Explores the uniqueness of minimal polynomials and the division algorithm for polynomials.
Division Polynomials: Theorems and Applications
Explores division polynomials, theorems, spectral values, and minimal polynomials in endomorphisms and vector spaces.
Euclid and Bézout: Algorithms and Theorems
Explores the Euclidean algorithm, Bézout's identity, extended Euclid algorithm, and commutative groups in mathematics.
Polynomials and Endomorphisms
Covers the fundamentals of polynomials, endomorphisms, division, roots, matrices, and algebraic homomorphisms.
Polynomial Rings and Irreducibility Criteria
Covers polynomial rings, irreducibility criteria, and algebraic structures in fields.
Polynomial Factorization and Decomposition
Covers polynomial factorization, irreducible polynomials, ideal decomposition, and the theorem of Bézout.
Polynomial Roots: Finding Solutions and Division
Explains how to find solutions for polynomial equations and perform polynomial division.
Number Theory: GCD and LCM
Covers GCD, LCM, and the Euclidean algorithm for efficient computation of GCD.
Properties of Euclidean Domains
Explores the properties of Euclidean domains, including gcd, lcm, and the Chinese remainder theorem for polynomial rings.
Polynomial Division Approach & Observer Control
Covers the RST approach using polynomial division for system adjustment.
Euclidean Division: Uniqueness and Remainder
Explores Euclidean division for polynomials, emphasizing uniqueness of quotient and remainder.
Factorisation: The Fundamental Theorem of Algebra
Covers the Fundamental Theorem of Algebra, polynomial division, and complete factorization of complex polynomials.
Linear Algebra: Abstract Concepts
Introduces abstract concepts in linear algebra, focusing on operations with vectors and matrices.
Integers: Well Ordering and Induction
Explores well ordering, induction, Euclidean division, and prime factorization in integers.
Previous
Page 1 of 2
Next