Home
Graph Query
Download
About
Search
Login
Overview "Algorithm" (568 entries)
All Fields
Algorithms in Algebra (Lecture Notes, Summer Term 2017, Janko Böhm
Category: ConvexHull
Category: Eigenvalue Algorithms and Modifications
Classical Euclidean geometry algorithms and problems
Control Configuration Selection
Gaussian elimination AI generated category
General Algorithms
Inverse Scattering
Model Order Reduction
Model Order Reduction Benchmarks
Numerical Linear Algebra
Optimization (manual node)
Reconstruction Algorithms in Natterer-Wübbeling (2001)
Runge-Kutta methods
Some classes from Periodic Table of Finite Elements
Sorting algorithms (default category sorting)
Tomography
~Testing
➔ Tournament sort: selection via tournament tree (winner tree) for O(n log n) sorting
➔ TPWL / Trajectory Piecewise-Linear
➔ Trial division algorithm for testing divisibility and basic primality up to a bound
➔ trust-region methods that constrain steps to a radius where the model is trusted
➔ trust-region newton method using a safeguarded local quadratic model and radius adaptation
➔ Unstable Balanced Truncation
➔ Uzawa iteration
➔ Vector Fitting
➔ Von Mises Iteration / Power Method / Power Iteration
➔ Weak-heapsort: heap-based sorting using weak-heap structure with near-optimal comparisons
➔ — irreducible decomposition of monomial ideals by inductive splitting and deletion of redundant factors
➔ — iterative normalization via test ideal enlargement A_{i+1}=A_i[ (1/g)(gJ_i:_{A_i} J_i ) ] until stationary
➔ — monomial primary decomposition via grouping irreducible factors with identical radicals
« First
Previous
…
34
35
36
37
38
Next
Last »