Search results
Jump to navigation
Jump to search
Page title matches
- "'''An Essay Towards Solving a Problem in the Doctrine of Chances'''" is a work on the mathematical [[theory of pr ...now called [[Bayes's Theorem]], together with a detailed treatment of the problem of setting a [[prior probability]]. ...9 KB (1,493 words) - 00:39, 23 February 2025
Page text matches
- ...rameterized. In a '''generalized semi-infinite programming''' ('''GSIP''') problem, the feasible set of the parameters depends on the variables.<ref>O. Stein == Mathematical formulation of the problem == ...2 KB (246 words) - 02:21, 25 July 2024
- ...members. It can be obtained by solving a corresponding linear programming problem <math>P(S)</math> as follows. ...mputation (game theory)|imputation]] can be computed by solving the [[dual problem]] of <math>P(N)</math>. Let <math>\alpha</math> be the optimal dual solutio ...3 KB (434 words) - 18:42, 25 July 2020
- ...he quotations relate to the ''[[Chakravala method|cakravala]]'' method for solving indeterminate integral equations of the form <math> Nx^2+1=y^2</math>. This ==A problem and its solution== ...4 KB (632 words) - 09:00, 28 September 2024
- ...ble, then so-called ''Benders cuts'' are generated and added to the master problem, which is then re-solved until no cuts can be generated. Since Benders deco ...em were violated, they can be added back to the master problem. The master problem is then re-solved. ...11 KB (1,766 words) - 20:06, 2 November 2024
- {{Short description|Numerical method for solving differential equations}} ...applied mathematics]] '''Strang splitting''' is a [[numerical method]] for solving [[differential equation]]s that are decomposable into a sum of differential ...4 KB (553 words) - 22:30, 17 January 2024
- ...nd]] algorithms for solving multiprocessor scheduling problem. Fernandez's problem derives a better lower bound than HF{{What|date=November 2021}}, and propos ...1,023 bytes (137 words) - 06:39, 17 June 2024
- {{Short description|Mathematical optimization problem}} ...asis pursuit denoising''' (BPDN) refers to a [[mathematical optimization]] problem of the form ...5 KB (663 words) - 08:17, 19 February 2025
- ...h> by fixing one of them and solving the corresponding convex optimization problem.<ref name=Survey /> ...3 KB (400 words) - 19:03, 5 July 2023
- ...problem''', or the <math>\bar{\partial}</math>-problem, is the problem of solving the [[differential equation]] ...ger equation|Schrödinger operators]] and generalizes the [[Riemann–Hilbert problem]].{{sfn|Ablowitz|Fokas|2003}}{{sfn|Haslinger|2014}}{{sfn|Konopelchenko|2000 ...2 KB (295 words) - 23:33, 26 August 2024
- ...theory]], '''semi-infinite programming''' ('''SIP''') is an [[optimization problem]] with a finite number of variables and an infinite number of constraints, ==Mathematical formulation of the problem== ...4 KB (521 words) - 07:56, 10 January 2025
- ...sweeping method''' is a [[numerical method]] for solving [[boundary value problem]]s of the [[Eikonal equation]]. Sweeping algorithms are highly efficient for solving Eikonal equations when the corresponding [[Method of characteristics|charac ...2 KB (311 words) - 06:40, 19 May 2024
- The integral is used as a popular problem and puzzle in various webs and videos online. It was proposed by '''Zafar A == Methods of solving == ...3 KB (452 words) - 16:01, 30 January 2025
- ...to the stability of a numerical scheme applied to the simple initial value problem <math> y'(x) = 0</math>. ...1=Ernst |last2=Nørsett |first2=Syvert |last3=Wanner |first3=Gerhard |title=Solving Ordinary Differential Equations I |date=1987 |publisher=Springer-Verlag |lo ...2 KB (328 words) - 02:08, 21 February 2024
- The '''in-crowd algorithm''' is a numerical method for solving [[basis pursuit denoising]] quickly; faster than any other algorithm for la ...are expected to be non-zero. Thus, if they can be identified, solving the problem restricted to these coefficients yield the solution. Here, the features are ...3 KB (550 words) - 04:56, 31 July 2024
- {{Short description|Method of solving linear programming problems}} In [[operations research]], the '''Big M method''' is a method of solving [[linear programming]] problems using the [[simplex algorithm]]. The Big M ...5 KB (839 words) - 08:21, 3 June 2024
- ...of the function <math>\Psi</math>, solving for the maximizer can be a hard problem. ...samples, for each sample <math>(\boldsymbol{x}_i,y_i)</math> the following problem needs to be solved. ...7 KB (1,102 words) - 10:50, 29 January 2023
- ...quation, the problem splits in two parts. First, the '''[[ideal membership problem]]''', which consists, given a non-homogeneous equation ...generated by the {{math|''a<sub>i</sub>''}}. The simplest instance of this problem is, for {{math|1=''k'' = 1}} and {{math|1=''b'' = 1}}, to decide if {{mvar| ...10 KB (1,615 words) - 01:13, 20 January 2025
- ...site (<math> \mathbf{\sigma}</math> are the Pauli matrices). In the Kondo problem, <math>J < 0</math>, i.e. the exchange coupling is antiferromagnetic. ==Solving the Kondo Model== ...5 KB (709 words) - 21:25, 12 June 2024
- ...be known if a polygon can be fan triangulated by solving the [[Art gallery problem]], in order to determine whether there is at least one vertex that is visib * Although this triangulation is fit for solving certain problems, such as [[Rasterisation]], or [[collision detection]], it ...3 KB (410 words) - 03:45, 9 June 2022
- {{Short description|Problem in microeconomics}} ...n to satisfy a system of [[partial differential equations]] in prices, and solving (integrating) this system is a crucial step in recovering the underlying ut ...6 KB (864 words) - 22:23, 20 November 2024