Search results

...ar inequalities]]:<ref>[[Eric W. Weisstein]] ''CRC Concise Encyclopedia of Mathematics,'' 2002, {{isbn|1-58488-347-2}}, p.&nbsp;3154, article "vertex enumeration" ...nd ''b'' is an ''m''×1 column vector of constants. The inverse ([[Duality (mathematics)|dual]]) problem of finding the bounding inequalities given the vertices is ...

...tion between [[Graph (discrete mathematics)|graph]] [[reachability]] and [[Computational complexity theory#Complexity classes|complexity classes]].{{fact|date=May 2 ...there is an edge from one configuration to another if it corresponds to a computational step of the model.{{fact|date=May 2016}} ...

In mathematics, a '''sum of radicals''' is defined as a finite [[linear combination]] of [ ...ents, in [[polynomial time]]. This is of importance for many problems in [[computational geometry]], since the computation of the [[Euclidean distance]] between two ...

...ogy#Computational homology|computational homology]].<ref>{{Cite book|title=Computational homology|first=Tomasz|last=Kaczynski|date=2004|publisher=Springer|others=Mi ...

'''Toda's theorem''' is a result in [[computational complexity theory]] that was proven by [[Seinosuke Toda]] in his paper "PP ...A Complex Analogue of Toda's Theorem''], in ''Foundations of Computational Mathematics''</ref> ...

...title=Option valuation using the fast Fourier transform|journal=Journal of Computational Finance|volume=2|issue=4|pages=61–73|doi=10.21314/JCF.1999.043|citeseerx=10 ...Press|year=2013|isbn=9781439829578|pages=1–82|url=https://www.crcpress.com/Computational-Methods-in-Finance/Hirsa/p/book/9781439829578 ...

{{short description|Computational geometry concept}} ...the '''Tukey depth''' <ref>{{cite book |last1=Tukey |first1=John W |title=Mathematics and the Picturing of Data |date=1975 |publisher=Proceedings of the Internat ...

...rcuit]] [[model of computation]] in which inputs to the circuit are [[set (mathematics)|set]]s of [[integer]]s and each gate of the circuit computes either a set ...is in the output of the circuit ''C'' when provided with input ''X''. The computational complexity of this problem depends on the type of gates allowed in the circ ...

In [[computational geometry]], the '''source unfolding''' of a [[convex polyhedron]] is a [[Ne ...2408 | citeseerx = 10.1.1.150.9715}}. Announced at the Japan Conference on Computational Geometry and Graphs, 2009.</ref> ...

...order <math>n = 2^m</math> would have a [[Computational complexity theory|computational complexity]] of [[Big O notation|O(<math>n^2</math>)]]. The FWHT<sub>''h'' ...

In mathematics, a '''bipartite matroid''' is a [[matroid]] all of whose circuits have [[ev ==Computational complexity== ...

...time'' is measured, and how the ''input size'' is measured. Two prominent computational models are the [[Turing machine|Turing-machine]] model and the [[Arithmetic ...integer or rational numbers. It is particularly common in [[Optimization (mathematics)|optimization]]. ...

...nk.springer.com/10.1007/s41468-022-00110-9 |journal=Journal of Applied and Computational Topology |language=en |doi=10.1007/s41468-022-00110-9 |arxiv=2109.05513 |s2 ...l=https://link.springer.com/10.1007/s00454-022-00476-8 |journal=Discrete & Computational Geometry |language=en |doi=10.1007/s00454-022-00476-8 |issn=0179-5376|arxiv ...

...man phrase "Algorithmische Geometrie" [algorithmic geometry] to refer to [[computational geometry]].{{r|raf}} He is a professor of computer science at the [[Free Un ...Computational Geometry]].{{r|raf}} At the same International Symposium on Computational Geometry, Alt's work with Michael Godau on using Fréchet distance to measur ...

In applied mathematics, the '''Rosenbrock system matrix''' or '''Rosenbrock's system matrix''' of For computational purposes, a short form of the Rosenbrock system matrix is more appropriate< ...

...on of grid in cfd.JPG|thumb|Fig 1 Formation of grid in cfd]]Almost every [[computational fluid dynamics]] problem is defined under the limits of initial and boundar '''The most common boundary conditions used in [[computational fluid dynamics]] are''' ...

| awards = Fellow of the Society for Industrial and Applied Mathematics ...cess-date=28 February 2022 |website=Committee on Computational and Applied Mathematics (CCAM)}}</ref> ...

# David Betounes, Partial Differential Equations for [[Computational science|Computational Science]]: With Maple and [[Vector Analysis]] Springer, 1998 {{ISBN|9780387 ...Invariants of Coupled Hirota-Satsuma KdV Equations]. Kragujevac Journal of Mathematics 49 (5), 793-805, 2025 {{Doi|10.46793/KgJMat2505.793H}} ...

...to [[electronic structure]] determination which is based on [[Functional (mathematics)|functional]]s of the [[electronic density]]. It is most closely related to ...m Hamiltonian for solving for the Kohn–Sham orbitals, therefore saving the computational cost. Since no Kohn–Sham orbital is involved in orbital-free density functi ...

...l solid mechanics International Workshop on Verification and Validation in Computational Science University of Notre Dame 17–19 October 2011.</ref> and specific tec ...ka I. Methodology of model development in the applied sciences. Journal of Computational and Applied Mechanics. 16(2), 75--86, 2021. DOI: 10.32973/jcam.2021.005 [ht ...