Home
Graph Query
Download
About
Search
Login
Overview "Algorithmic Task" (202 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
➔ Compute the Hermite normal form of a matrix over a principal ideal domain
➔ Compute the ideal quotient I:J in K[x1,...,x_n]
➔ Compute the intersection I ∩ J of polynomial ideals
➔ Compute the Jordan normal form and Jordan block data of a linear map from invariant factors
➔ Compute the normalization A of A=K[x1,…,xn]/I
➔ Compute the Smith normal form of an integer/polynomial matrix and the associated invariant/elementary divisors
➔ Compute the Zariski closure of the image of a rational map ϕ: X → A^n
➔ Computerized Tomography
➔ Cone beam CT
➔ Construction of a Reduced Basis for Parametric Differential Equations
➔ continuous optimization problems including unconstrained/constrained smooth and non-smooth cases
➔ Control Configuration Selection / Input-Output Pairing / CCS / Decentralized Control
➔ Convex Hull Computation Problem
➔ convex optimization problem class
➔ Decide and construct elementary antiderivatives (integration in finite terms)
« First
Previous
1
2
3
4
5
6
…
Next
Last »