discrete event simulation and simulation of continuous systems. This section details the two primary methods in which humans interface with simulations, and it also distinguishes the meaning, importance, and significance of verification and validation. Practical Domains delves into specific topics related ...
Algorithmic Principles of Mathematical Programming investigates the mathematical structures and principles underlying the design of efficient algorithms for optimization problems. Recent advances in algorithmic theory have shown that the traditionally separate areas of discrete optimization, linear programming, and...
Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles When teaching Discrete Math I may pose the student William,Gasarch - 《Sigact News》 被引量: 2发表: 2016年 Principles of the Mathematical Analysis of Many-Valued Functions For many-valued...
DISCRETE MAXIMUM PRINCIPLES Master’s Thesis by Csirik Mih´ aly Applied mathematics (Msc) Adviser: Kar´ atson J´ anos docent Department of Applied Analysis E ¨ OTV ¨ OS LOR ´ AND TUDOM ´ ANYEGYETEM TERM ´ ESZETTUDOM ´ ANYI KAR 2013 This page is intentionally left blank...
About Delaunay Triangulations and Discrete Maximum Principles for the Linear Conforming FEM Applied to the Poisson Equation The paper is devoted to the study of convergence properties for an often used cell-centered full-upwind Finite Volume Method (FVM) with Voronoi boxes. This... R Vanselow - ...
Roucairol, “A new exact algorithm for the solution of quadratic assignment problems”, Discrete Applied Mathematics 55 (1994) 281–293. Article MathSciNet MATH Google Scholar C. Nugent, T. Vollmann, J. Ruml, “An experimental comparison of techniques for the assignment of facilities to ...
In this work, we present and discuss some modifications, in the form of two-sided estimation (and also for arbitrary source functions instead of usual sign-conditions), of continuous and discrete maximum principles for the reactiondiffusion problems solved by the finite element and finite difference...
This conjecture, which is known as P≠ NP, is the most important open question in computer science. Examples of problems for which no polynomial-time algorithms are known but whose solution can be verified in polynomial time are integer factorization and the discrete-logarithm problem (DLP)....
Second, the complexified discrete sine-Gordon equation constitutes an ... JJC Nimmo,WK Schief - 《Studies in Applied Mathematics》 被引量: 0发表: 1998年 Localized excitations of the (2+1)-dimensional sine-Gordon system The (2 + 1)-dimensional sine-Gordon system is investigated via a ...
The survey is intended for mathematicians, physicists, working in both theoretical and applied areas, as well as for graduate students of physics and mathematics. This is a preview of subscription content, log in via an institution to check access. Similar content being viewed by others On ...