Search results for "model theory"

showing 10 items of 681 documents

Cholesky decomposition techniques in electronic structure theory

2011

We review recently developed methods to efficiently utilize the Cholesky decomposition technique in electronic structure calculations. The review starts with a brief introduction to the basics of the Cholesky decomposition technique. Subsequently, examples of applications of the technique to ab inito procedures are presented. The technique is demonstrated to be a special type of a resolution-of-identity or density-fitting scheme. This is followed by explicit examples of the Cholesky techniques used in orbital localization, computation of the exchange contribution to the Fock matrix, in MP2, gradient calculations, and so-called method specific Cholesky decomposition. Subsequently, examples o…

Computer and Information SciencesTheoretical computer scienceBasis (linear algebra)Computer scienceCalibration (statistics)ComputationAb initioMathematicsofComputing_NUMERICALANALYSISData- och informationsvetenskapKemiType (model theory)Fock matrixChemical SciencesPruning (decision trees)AlgorithmCholesky decomposition
researchProduct

Transformations that preserve learnability

1996

We consider transformations (performed by general recursive operators) mapping recursive functions into recursive functions. These transformations can be considered as mapping sets of recursive functions into sets of recursive functions. A transformation is said to be preserving the identification type I, if the transformation always maps I-identifiable sets into I-identifiable sets.

Computer scienceLearnabilityType (model theory)Inductive reasoningAlgebraTuring machinesymbols.namesakeIdentification (information)TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTransformation (function)TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSRecursive functionssymbolsInitial segment
researchProduct

Statistical geometric affinity in human brain electric activity

2007

10 pages, 9 figures.-- PACS nrs.: 87.19.La; 05.45.Tp.-- ISI Article Identifier: 000246890100105

Computer scienceModels NeurologicalNeurophysiologyElectroencephalographyInterpretation (model theory)[PACS] Time series analysis (nonlinear dynamical systems)LacunaritymedicineHumansComputer SimulationDiagnosis Computer-AssistedWakefulnessRepresentation (mathematics)ScalingEvoked PotentialsModels Statisticalmedicine.diagnostic_testbusiness.industry[PACS] Neuroscience (higher organisms)BrainPattern recognitionElectroencephalographyNeurophysiologyAmplitudeStatistical analysisData Interpretation StatisticalBioelectric phenomenaLacunarityAffine transformationArtificial intelligenceSleep StagesbusinessSleep
researchProduct

Theoretical Foundations of the Monte Carlo Method and Its Applications in Statistical Physics

2002

In this chapter we first introduce the basic concepts of Monte Carlo sampling, give some details on how Monte Carlo programs need to be organized, and then proceed to the interpretation and analysis of Monte Carlo results.

Computer scienceMonte Carlo methodThermodynamic limitPeriodic boundary conditionsMonte Carlo method in statistical physicsIsing modelStatistical physicsImportance samplingMonte Carlo molecular modelingInterpretation (model theory)
researchProduct

Competition of Dzyaloshinskii-Moriya and Higher-Order Exchange Interactions in Rh/Fe Atomic Bilayers on Ir(111)

2018

Using spin-polarized scanning tunneling microscopy and density functional theory we demonstrate the occurrence of a novel type of noncollinear spin structure in $\mathrm{Rh}/\mathrm{Fe}$ atomic bilayers on Ir(111). We find that higher-order exchange interactions depend sensitively on the stacking sequence. For fcc-$\mathrm{Rh}/\mathrm{Fe}/\mathrm{Ir}(111)$, frustrated exchange interactions are dominant and lead to the formation of a spin spiral ground state with a period of about 1.5 nm. For hcp-$\mathrm{Rh}/\mathrm{Fe}/\mathrm{Ir}(111)$, higher-order exchange interactions favor an up-up-down-down ($\ensuremath{\uparrow}\ensuremath{\uparrow}\ensuremath{\downarrow}\ensuremath{\downarrow}$) s…

Condensed Matter::Quantum GasesPhysicsCondensed matter physicsMagnetic momentStackingGeneral Physics and Astronomy02 engineering and technologySpin structureType (model theory)021001 nanoscience & nanotechnology01 natural scienceslaw.inventionlaw0103 physical sciencesPhysics::Atomic and Molecular ClustersCondensed Matter::Strongly Correlated ElectronsDensity functional theoryScanning tunneling microscope010306 general physics0210 nano-technologySpin (physics)Ground statePhysical Review Letters
researchProduct

On Severi Type Inequalities for Irregular Surfaces

2017

Let X be a minimal surface of general type and maximal Albanese dimension with irregularity q ≥ 2. We show that K2 X ≥ 4χ(OX) + 4(q − 2) if K2 X < 9 2 χ(OX), and also obtain the characterization of the equality. As a consequence, we prove a conjecture of Manetti on the geography of irregular surfaces if K2 X ≥ 36(q−2) or χ(OX) ≥ 8(q−2), and we also prove a conjecture that the surfaces of general type and maximal Albanese dimension with K2 X = 4χ(OX) are exactly the resolution of double covers of abelian surfaces branched over ample divisors with at worst simple singularities.

ConjectureMinimal surfaceGeneral Mathematics010102 general mathematicsCharacterization (mathematics)Type (model theory)01 natural sciencesCombinatoricsSimple (abstract algebra)Gravitational singularity0101 mathematicsAbelian groupMathematicsResolution (algebra)International Mathematics Research Notices
researchProduct

An optimality test for semi-infinite linear programming

1992

In this paper we present a test to characterize the optimal solutions for the continuous semi-infinite linear programming problem. This optimality characterization is a condition of Kuhn–Tucker type. The resolution of a linear program permits to check the optimality of a feasible point,to detect the unboundedness of the problem and to find descent directions. We give some illustrative examples. We show that the local Mangasarian–Fromovitz constraint qualification is almost equivalent to Slater qualification for this problem. Furthermore, it follows from our study that this optimality condition is always necessary for a wide class of semi-infinite linear programming problems

Constraint (information theory)Mathematical optimizationControl and OptimizationLinear programmingSemi-infiniteApplied MathematicsPoint (geometry)Management Science and Operations ResearchType (model theory)Semi-infinite programmingLinear-fractional programmingDescent (mathematics)MathematicsOptimization
researchProduct

Fixed Point Theorems in Partially Ordered Metric Spaces and Existence Results for Integral Equations

2012

We derive some new coincidence and common fixed point theorems for self-mappings satisfying a generalized contractive condition in partially ordered metric spaces. As applications of the presented theorems, we obtain fixed point results for generalized contraction of integral type and we prove an existence theorem for solutions of a system of integral equations.

Control and OptimizationMathematical analysisFixed-point theoremExistence theoremFixed pointType (model theory)Fixed-point propertyIntegral equationComputer Science ApplicationsMetric spaceSettore MAT/05 - Analisi MatematicaSignal ProcessingFixed point integral equations ordered metric spaceCoincidence pointAnalysisMathematicsNumerical Functional Analysis and Optimization
researchProduct

Probabilistic interpretation of the Calderón problem

2017

In this paper, we use the theory of symmetric Dirichlet forms to give a probabilistic interpretation of Calderon's inverse conductivity problem in terms of reflecting diffusion processes and their corresponding boundary trace processes. This probabilistic interpretation comes in three equivalent formulations which open up novel perspectives on the classical question of unique determinability of conductivities from boundary data. We aim to make this work accessible to both readers with a background in stochastic process theory as well as researchers working on deterministic methods in inverse problems.

Control and OptimizationStochastic processComputer science010102 general mathematicsProbabilistic logicBoundary (topology)Inverse problem01 natural sciencesDirichlet distributionInterpretation (model theory)010104 statistics & probabilitysymbols.namesakeModeling and SimulationNeumann boundary conditionsymbolsDiscrete Mathematics and CombinatoricsApplied mathematics0101 mathematicsAnalysisTRACE (psycholinguistics)Inverse Problems &amp; Imaging
researchProduct

Controllability-type properties for elliptic systems and applications

1991

We consider approximate and exact controllability results for elliptic problems. These results enable one to formulate optimal shape design problems in a fixed domain with certain boundary conditions.

ControllabilityShape designElliptic systemsMathematical analysisBoundary value problemType (model theory)MathematicsDomain (software engineering)
researchProduct