Search results for "Applied"

showing 10 items of 9160 documents

Reduced Order Models for Pricing American Options under Stochastic Volatility and Jump-diffusion Models

2016

American options can be priced by solving linear complementary problems (LCPs) with parabolic partial(-integro) differential operators under stochastic volatility and jump-diffusion models like Heston, Merton, and Bates models. These operators are discretized using finite difference methods leading to a so-called full order model (FOM). Here reduced order models (ROMs) are derived employing proper orthogonal decomposition (POD) and non negative matrix factorization (NNMF) in order to make pricing much faster within a given model parameter variation range. The numerical experiments demonstrate orders of magnitude faster pricing with ROMs. peerReviewed

ta113Mathematical optimizationStochastic volatilityDiscretizationComputer scienceJump diffusionFinite difference method010103 numerical & computational mathematics01 natural sciencesNon-negative matrix factorization010101 applied mathematicsValuation of optionslinear complementary problemRange (statistics)General Earth and Planetary SciencesApplied mathematicsreduced order modelFinite difference methods for option pricing0101 mathematicsAmerican optionoption pricingGeneral Environmental ScienceProcedia Computer Science
researchProduct

Synchronous R-NSGA-II: An Extended Preference-Based Evolutionary Algorithm for Multi-Objective Optimization

2015

Classical evolutionary multi-objective optimization algorithms aim at finding an approx- imation of the entire set of Pareto optimal solutions. By considering the preferences of a decision maker within evolutionary multi-objective optimization algorithms, it is possible to focus the search only on those parts of the Pareto front that satisfy his/her preferences. In this paper, an extended preference-based evolutionary algorithm has been proposed for solving multi-objective optimiza- tion problems. Here, concepts from an interactive synchronous NIMBUS method are borrowed and combined with the R-NSGA-II algorithm. The proposed synchronous R-NSGA-II algorithm uses preference information provid…

ta113Mathematical optimizationinteractive multi-objective optimizationApplied MathematicsEvolutionary algorithmApproxDecision makerMulti-objective optimizationscalarizing functionSet (abstract data type)Pareto optimalevolutionary multi-objective optimizationpreference-based evolutionary algorithmsFocus (optics)Preference (economics)Information SystemsMathematicsInformatica
researchProduct

A New Augmented Lagrangian Approach for $L^1$-mean Curvature Image Denoising

2015

Variational methods are commonly used to solve noise removal problems. In this paper, we present an augmented Lagrangian-based approach that uses a discrete form of the L1-norm of the mean curvature of the graph of the image as a regularizer, discretization being achieved via a finite element method. When a particular alternating direction method of multipliers is applied to the solution of the resulting saddle-point problem, this solution reduces to an iterative sequential solution of four subproblems. These subproblems are solved using Newton’s method, the conjugate gradient method, and a partial solution variant of the cyclic reduction method. The approach considered here differs from ex…

ta113Mean curvatureDiscretizationimage denoisingAugmented Lagrangian methodApplied MathematicsGeneral Mathematicsmean curvaturekuvankäsittelyTopologyFinite element methodimage processingsymbols.namesakeLagrangian relaxationLagrange multiplierConjugate gradient methodsymbolsApplied mathematicsaugmented Lagrangian methodalternating direction methods of multipliersvariational modelMathematicsCyclic reductionSIAM Journal on Imaging Sciences
researchProduct

IMEX schemes for pricing options under jump–diffusion models

2014

We propose families of IMEX time discretization schemes for the partial integro-differential equation derived for the pricing of options under a jump-diffusion process. The schemes include the families of IMEX-midpoint, IMEX-CNAB and IMEX-BDF2 schemes. Each family is defined by a convex combination parameter [email protected]?[0,1], which divides the zeroth-order term due to the jumps between the implicit and explicit parts in the time discretization. These IMEX schemes lead to tridiagonal systems, which can be solved extremely efficiently. The schemes are studied through Fourier stability analysis and numerical experiments. It is found that, under suitable assumptions and time step restric…

ta113Numerical AnalysisMathematical optimizationTridiagonal matrixDiscretizationApplied MathematicsJump diffusionStability (probability)Term (time)Computational MathematicsValuation of optionsConvex combinationLinear multistep methodMathematicsApplied Numerical Mathematics
researchProduct

A Stochastic Algorithm Based on Fast Marching for Automatic Capacitance Extraction in Non-Manhattan Geometries

2014

WOS:000346854900026 (Nº de Acesso Web of Science) We present an algorithm for two- and three-dimensional capacitance analysis on multidielectric integrated circuits of arbitrary geometry. Our algorithm is stochastic in nature and as such fully parallelizable. It is intended to extract capacitance entries directly from a pixelized representation of the integrated circuit (IC), which can be produced from a scanning electron microscopy image. Preprocessing and monitoring of the capacitance calculation are kept to a minimum, thanks to the use of distance maps automatically generated with a fast marching technique. Numerical validation of the algorithm shows that the systematic error of the algo…

ta113Parallelizable manifoldSEM image segmentationComputer scienceMatemáticasApplied MathematicsGeneral MathematicsFast marchingCapacitance extractionIntegrated circuitResolution (logic)CapacitanceImage (mathematics)law.inventionNon-Manhattan IClawFloating random walkPreprocessorRepresentation (mathematics)AlgorithmFast marching method
researchProduct

Functional inequalities for generalized inverse trigonometric and hyperbolic functions

2014

Various miscellaneous functional inequalities are deduced for the so-called generalized inverse trigonometric and hyperbolic functions. For instance, functional inequalities for sums, difference and quotient of generalized inverse trigonometric and hyperbolic functions are given, as well as some Gr\"unbaum inequalities with the aid of the classical Bernoulli inequality. Moreover, by means of certain already derived bounds, bilateral bounding inequalities are obtained for the generalized hypergeometric ${}_3F_2$ Clausen function.

ta113Pure mathematicsGeneralized inverseBernoulli's inequalityGeneralized inverse trigonometric functions; Generalized inverse hyperbolic functions; Functional inequalities; Generalized hypergeometric 3F2 functionApplied MathematicsHyperbolic functionMathematics::Classical Analysis and ODEsHypergeometric distributionClausen functionMathematics - Classical Analysis and ODEsBounding overwatchClassical Analysis and ODEs (math.CA)FOS: MathematicsTrigonometry33B99 26D15 33C20 33C99AnalysisQuotientMathematicsJournal of Mathematical Analysis and Applications
researchProduct

Evaluating the performance of artificial neural networks for the classification of freshwater benthic macroinvertebrates

2014

Abstract Macroinvertebrates form an important functional component of aquatic ecosystems. Their ability to indicate various types of anthropogenic stressors is widely recognized which has made them an integral component of freshwater biomonitoring. The use of macroinvertebrates in biomonitoring is dependent on manual taxa identification which is currently a time-consuming and cost-intensive process conducted by highly trained taxonomical experts. Automated taxa identification of macroinvertebrates is a relatively recent research development. Previous studies have displayed great potential for solutions to this demanding data mining application. In this research we have a collection of 1350 …

ta113Radial basis function networkEcologyArtificial neural networkComputer sciencebusiness.industryApplied MathematicsEcological Modelingta1172PerceptronMachine learningcomputer.software_genreBackpropagationComputer Science ApplicationsProbabilistic neural networkIdentification (information)Computational Theory and MathematicsModeling and SimulationMultilayer perceptronConjugate gradient methodta1181Artificial intelligencebusinesscomputerEcology Evolution Behavior and SystematicsEcological Informatics
researchProduct

Omission of Causal Indicators: Consequences and Implications for Measurement – A Rejoinder

2016

ta113Statistics and ProbabilityApplied Mathematics05 social sciences050401 social sciences methodsResearch needsEducation0504 sociology0502 economics and businesscausal indicatorsmeasurementPositive economicsPsychologySocial psychology050203 business & managementCausal modelMeasurement: Interdisciplinary Research and Perspectives
researchProduct

LOCAL CONTROL OF SOUND IN STOCHASTIC DOMAINS BASED ON FINITE ELEMENT MODELS

2011

A numerical method for optimizing the local control of sound in a stochastic domain is developed. A three-dimensional enclosed acoustic space, for example, a cabin with acoustic actuators in given locations is modeled using the finite element method in the frequency domain. The optimal local noise control signals minimizing the least square of the pressure field in the silent region are given by the solution of a quadratic optimization problem. The developed method computes a robust local noise control in the presence of randomly varying parameters such as variations in the acoustic space. Numerical examples consider the noise experienced by a vehicle driver with a varying posture. In a mod…

ta113Stochastic domainAcoustics and UltrasonicsComputer scienceApplied MathematicsAcousticsNoise reductionNumerical analysisstokastinen aluekvadraattinen optimointipassenger carFinite element methodhenkilöautoelementtimenetelmäAcoustic spacequadratic optimizationNoiseFrequency domainNoise controlHelmholtz equationQuadratic programmingpaikallinen äänenhallintaäärellisten elementtien menetelmäHelmholtzin yhtälölocal sound controlJournal of Computational Acoustics
researchProduct

Context–content systems of random variables : The Contextuality-by-Default theory

2016

Abstract This paper provides a systematic yet accessible presentation of the Contextuality-by-Default theory. The consideration is confined to finite systems of categorical random variables, which allows us to focus on the basics of the theory without using full-scale measure-theoretic language. Contextuality-by-Default is a theory of random variables identified by their contents and their contexts, so that two variables have a joint distribution if and only if they share a context. Intuitively, the content of a random variable is the entity the random variable measures or responds to, while the context is formed by the conditions under which these measurements or responses are obtained. A …

ta113Theoretical computer scienceComputer scienceApplied Mathematicscouplings05 social sciencesta111Probabilistic logicContext (language use)01 natural sciencesMeasure (mathematics)050105 experimental psychologyconnectednessKochen–Specker theoremrandom variablesJoint probability distribution0103 physical sciences0501 psychology and cognitive sciencescontextualityNegative number010306 general physicsCategorical variableRandom variableGeneral PsychologyJournal of Mathematical Psychology
researchProduct