Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Accuracy and Stability: Algorithms Performance
Graph Chatbot
Related lectures (31)
Belief Propagation: Key Methods and Analysis
Covers Belief Propagation, a key method for both analysis and algorithm.
Solving Parity Games in Practice
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Numerical Methods: Exercises
Covers exercises related to numerical methods, focusing on computational algorithms and problem-solving strategies.
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Explicit Stabilised Methods: Applications to Bayesian Inverse Problems
Explores explicit stabilised Runge-Kutta methods and their application to Bayesian inverse problems, covering optimization, sampling, and numerical experiments.
Nonlinear Analysis of Structures
Explores nonlinear analysis of structures, including the Newmark Method and modeling strategies.
Matrix Multiplication and Divide-and-Conquer Techniques
Discusses matrix multiplication using divide-and-conquer techniques and introduces Strassen's algorithm for improved efficiency.
Explicit Stabilised Methods: Stochastic Differential Equations
Covers explicit stabilized methods for stiff stochastic differential equations, analyzing their properties and applications.
Ordinary Differential Equations: Methods and Applications
Explores ordinary differential equations and numerical integration methods for stability and accuracy.
Factoring Polynomials: Complexity and Algorithms
Delves into the complexity of factoring polynomials and the implications for security.
Search Algorithms: Dichotomy Search
Explores dichotomy search algorithms, analyzing complexity and implementation details for efficient searching in sorted lists.
Molecular dynamics under constraints
Explores molecular dynamics simulations under holonomic constraints, focusing on numerical integration and algorithm formulation.
Improved Algorithm: Three-Color Parity Games
Introduces an improved algorithm for three-color parity games, focusing on progress measures, acceleration, and practical speed-up.
Euler Method: Understanding Higher Order Runge-Kutta Schemes
Explains the Euler method and higher-order Runge-Kutta schemes for solving differential equations.
Distinct Elements: Count and Hash Functions
Covers counting distinct elements using hash functions and the median trick.
Algorithmic Complexity: Definition and Examples
Explores algorithm correctness, worst-case complexity analysis, and efficiency comparison based on input size.
Numerical Methods: Euler and Crank-Nicolson
Log in to Mediaspace to watch this video
Covers Euler and Crank-Nicolson methods for solving differential equations.
Numerical Integration: Euler Method
Log in to Mediaspace to watch this video
Covers the progressive Euler method for numerical integration of ODEs, including Cauchy problems and Runge-Kutta methods.
Numerical Analysis: Stability in ODEs
Log in to Mediaspace to watch this video
Covers the stability analysis of ODEs using numerical methods and discusses stability conditions.
Zero-stability and absolute-stability
Log in to Mediaspace to watch this video
Explores zero-stability and absolute-stability in numerical methods, including Forward Euler, Backward Euler, Crank-Nicolson, and Heun's methods.
Previous
Page 1 of 2
Next
