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
Concept
Approximation algorithm
Formal sciences
Theoretical computer science
Theory of computation
Computational complexity th...
Graph Chatbot
Related lectures (29)
Login to filter by course
Login to filter by course
Reset
Previous
Page 2 of 3
Next
Taylor Series: Basics
Covers Taylor series, polynomial approximations for function behavior, coefficient finding, and error estimation.
Approximation Techniques in Multivariable Functions
Explores Taylor polynomials for multivariable functions and their applications in function approximation.
Transformer Architectures: Subquadratic Attention Mechanisms
Covers transformer architecture and subquadratic attention mechanisms, focusing on efficient approximations and their applications in machine learning.
Numerical Analysis: Quadrature Formulas
Explores the theory and application of quadrature formulas for numerical analysis.
Submodular Maximization
Covers submodular function maximization using the greedy algorithm and its approximation guarantee.
Numerical Methods: Runge-Kutta Approximation
Covers the Runge-Kutta method for approximating solutions of differential equations.
Nonlinear Truss System Analysis
Explores nonlinear truss system analysis, covering force-displacement responses, event-to-event principles, and solution algorithms.
Gauss-Legendre Quadrature Formulas
Explores Gauss-Legendre quadrature formulas using Legendre polynomials for accurate function approximation.
Knapsack Problem: Optimization and Traveling Salesman
Explores the knapsack problem and the traveling salesman problem with a focus on optimization algorithms.
Laplacian Solvers
Explores Laplacian solvers, covering approximate solutions, applications, error conversion, and theoretical advancements in computational methods.