Search results

...em | author = Wilkinson | publisher = [[Oxford University Press]] | year = 1965 | isbn = 0-19-853418-3}}</ref> It is named after the British mathematician Wilkinson matrices have applications in many fields, including [[scientific computing]], [[numerical linear algebra]], and [[signal processing]]. ...

...tic|floating-point]] algorithm for computing the exact [[round-off error]] in a floating-point addition operation. 2Sum and its variant Fast2Sum were first published by Ole Møller in 1965.<ref name="moeller">{{cite journal ...

...xed step solver and <code>ode23</code> for a variable step solver function in [[MATLAB]] {{harv|Shampine|Reichelt|1997}}. ...that the stage value <math>k_4</math> in one step equals <math>k_1</math> in the next step; thus, only three function evaluations are needed per step. ...

...ear=1965| volume=60| number=311| pages=793&ndash;805| doi=10.1080/01621459.1965.10480828}}</ref> ...=M.| title=On the inverted Dirichlet distribution| journal=Communications in Statistics - Theory and Methods| year=2010| volume=39|pages=21&ndash;37| do ...

...is a [[mathematical theorem]] in [[sieve theory]]. It is a key ingredient in proofs of [[Chen's theorem]] on [[Goldbach's conjecture]].<ref name="Nathan ...com/books?id=8HA7l7i6SRkC |accessdate=2009-03-14 | series=[[Graduate Texts in Mathematics]] |volume=164 |year=1996 |publisher=[[Springer-Verlag]] | isbn= ...

...d. In contrast, a '''non-work conserving scheduler''' is a scheduler that, in some cases, may leave the scheduled resource(s) [[Idle (CPU)|idle]] despite ...</ref> leaves the channel idle only when there are no packets to transmit. In contrast, a non-work conserving scheduler might leave the channel idle with ...

{{Short description|Min-max theorem in graph theory}} In the mathematical discipline of [[graph theory]], the '''Erdős–Pósa theorem' ...

...ods for ordinary differential equations |journal=Mathematics and Computers in Simulation |date=February 2009 |volume=79 |issue=6 |pages=1834–1845 |doi=10 ...riginal class of methods were originally proposed by Butcher (1965), Gear (1965) and Gragg and Stetter (1964). ...

...iques in Social Networks: A New Distribution-Free Model. ''SIAM Journal on Computing'', ''49''(2), 448–464. https://doi.org/10.1137/18M1210459</ref> Informally, ...connected to each other by an edge. The concept of clusters is ubiquitous in [[data analysis]], such as on the analysis of [[social network]]s. For that ...

...sue=6 |pages=930–945 |doi=10.1287/opre.13.6.930}}</ref> CCP is widely used in various fields, including [[finance]], [[engineering]], and [[operations re ...ves the use of [[probability]] and confidence levels to handle uncertainty in optimization problems. It distinguishes between single and joint chance con ...

...nt sets in matroid sums, and to compute the largest common independent set in the [[matroid intersection|intersection]] of two given matroids.<ref name=" | series = Wiley-Interscience Series in Discrete Mathematics and Optimization ...

...3 conference in [[Alma-Ata]], Kazakhstan.<ref>[[Jaan Einasto|J. Einasto]] (1965), Kinematics and dynamics of stellar systems, ''Trudy Inst. Astrofiz. Alma- ...math> controls the degree of curvature of the profile. This can be seen by computing the slope on a log-log plot: ...

...(i.e. able to express by composition all ''n''-ary [[truth tables]]), and in the exact complete choice of axioms over the chosen basis of connectives. We assume this rule is included in all systems below unless stated otherwise. ...

{{Short description|Technique for computing light scattering by nonspherical particles}} ...|last1=Waterman |first1=Peter C. |title=Symmetry, unitarity, and geometry in electromagnetic scattering |journal=Physical Review D |date=1971 |volume=3 ...

...e:Gallai–Edmonds decomposition.svg|thumb|An illustration of the three sets in the Gallai–Edmonds decomposition of an example graph.|300px]] ...hematics | volume = 17 | pages = 449–467 | year = 1965 | doi = 10.4153/CJM-1965-045-4 | s2cid = 18909734 | language = en| doi-access = free }}</ref> indepe ...

...ain]]s of subsets of an <math>n</math>-element set, the number of elements in a [[free distributive lattice]] with <math>n</math> generators, and one mor ...}; {{harvtxt|Kisielewicz|1988}}.</ref> However '''Dedekind's problem''' of computing the values of <math>M(n)</math> remains difficult: no [[closed-form express ...

...of the history of the identity, it has been ascertained that Li Jen-Shu is in fact Li Shanlan.<ref name=history/> Western scholars had been studying Chin Li Shanlan did not present the identity in this way. He presented it in the traditional Chinese algorithmic and rhetorical way.<ref>{{cite book|fir ...

...r (computing)|interpreter]], a [[compiler]] and a still-growing [[Library (computing)|library]]<ref>[https://fricas.github.io/api/ FriCAS API]</ref> ...itle = Adding the axioms to Axiom: Towards a system of automated reasoning in Aldor| date = May 1998| format = Monograph| access-date = 2017-01-27| url = ...

...''. Review of Economic Studies, 51(4):683–692, 1984.</ref> In other words, in a series of repeated head-to-head matchups, voters will (on average) prefer ...reto efficiency]].<ref name="BrBr19a">F. Brandl and F. Brandt. [http://dss.in.tum.de/files/brandt-research/welfare.pdf Arrovian Aggregation of Convex Pre ...

...the solution to fixed point equations <math>f(x) = x</math> often arising in the field of [[computational science]]. ...terion is met. However, the convergence of such a scheme is not guaranteed in general; moreover, the [[rate of convergence]] is usually linear, which can ...