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
➔ QR Decomposition via Givens Rotations
➔ QR Decomposition via Gram-Schmidt
➔ QR Decomposition via Householder Reflections
➔ QR Decomposition via Modified Gram-Schmidt
➔ QR Decomposition via Rutishauser-Schwarz / Column-Wise Modified Gram-Schmidt
➔ Quadratic-Bilinear Balanced Truncation
➔ quasi-newton methods building Hessian or inverse-Hessian approximations from gradient/step pairs (bfgs, l-bfgs)
➔ Quickhull Algorithm (proposed)
➔ Quicksort: in-place partition-based divide-and-conquer comparison sorting algorithm (Hoare partition scheme)
➔ QZ (generalized Schur) algorithm for Ax = λBx
➔ Radix sort: LSD/MSD multi-pass distribution sorting by digits or characters
➔ Range Test for determining convex scattering support with unknown boundary conditions
➔ Rational Interpolation
➔ Rational Krylov eigensolvers (shift-and-invert / rational Arnoldi-Lanczos)
➔ Raviart-Thomas (RT_k)
« First
Previous
…
29
30
31
32
33
34
35
36
37
…
Next
Last »