Search results for " Simulation"

showing 10 items of 4034 documents

A fully adaptive multiresolution scheme for image processing

2007

A nonlinear multiresolution scheme within Harten's framework [A. Harten, Discrete multiresolution analysis and generalized wavelets, J. Appl. Numer. Math. 12 (1993) 153-192; A. Harten, Multiresolution representation of data II, SIAM J. Numer. Anal. 33 (3) (1996) 1205-1256] is presented. It is based on a centered piecewise polynomial interpolation fully adapted to discontinuities. Compression properties of the multiresolution scheme are studied on various numerical experiments on images.

Mathematics::Functional AnalysisPolynomialNumerical analysisMultiresolution analysisImage processingComputer Science ApplicationsPolynomial interpolationWaveletModelling and SimulationComputer Science::Computer Vision and Pattern RecognitionModeling and SimulationCompression (functional analysis)CalculusPiecewiseAlgorithmMathematicsMathematical and Computer Modelling
researchProduct

The Heterogeneous Fleet Vehicle Routing Problem with Draft Limits

2023

Over the past two decades, international maritime transport has been characterized by the advent of ever larger ships. This phenomenon is known as naval gigantism. If, on the one hand, naval gigantism allows to reduce transport costs by exploiting the economies of scale achievable by large ships, on the other hand, it implies a series of operational issues. Indeed, due to their large draft, such giant vessels are not allowed to enter small ports when fully or near-fully loaded, and in some cases, they cannot enter such small ports at all. In fact, their draft can strongly vary depending on the load on board. This implies restrictions for vessels in accessing ports, which impact not only at …

MatheuristicGeneral Computer ScienceModeling and SimulationLarge Neighborhood SearchDraft limitsHeterogeneous fleetManagement Science and Operations ResearchMaritime transportationRoutingComputers & Operations Research
researchProduct

A matheuristic for the Team Orienteering Arc Routing Problem

2015

In the Team OrienteeringArc Routing Problem (TOARP) the potential customers are located on the arcs of a directed graph and are to be chosen on the basis of an associated profit. A limited fleet of vehicles is available to serve the chosen customers. Each vehicle has to satisfy a maximum route duration constraint. The goal is to maximize the profit of the served customers. We propose a matheuristic for the TOARP and test it on a set of benchmark instances for which the optimal solution or an upper bound is known. The matheuristic finds the optimal solutions on all, except one, instances of one of the four classes of tested instances (with up to 27 vertices and 296 arcs). The average error o…

MatheuristicMathematical optimizationInformation Systems and ManagementGeneral Computer ScienceComputer scienceOrienteeringDirected graphManagement Science and Operations ResearchUpper and lower boundsIndustrial and Manufacturing EngineeringVertex (geometry)Constraint (information theory)Set (abstract data type)Routing problems with profitsArc routing problemModeling and SimulationBenchmark (computing)Team Orienteering ProblemDuration (project management)MATEMATICA APLICADAArc routing
researchProduct

Convergence of a high-order compact finite difference scheme for a nonlinear Black–Scholes equation

2004

A high-order compact finite difference scheme for a fully nonlinear parabolic differential equation is analyzed. The equation arises in the modeling of option prices in financial markets with transaction costs. It is shown that the finite difference solution converges locally uniformly to the unique viscosity solution of the continuous equation. The proof is based on a careful study of the discretization matrices and on an abstract convergence result due to Barles and Souganides.

Matrix difference equationFTCS schemeNumerical AnalysisPartial differential equationApplied MathematicsMathematical analysisCompact finite differenceNumerical solution of the convection–diffusion equationFinite difference coefficientCentral differencing schemeComputational MathematicsModeling and SimulationAnalysisCompact convergenceMathematicsESAIM: Mathematical Modelling and Numerical Analysis
researchProduct

Computing continuous numerical solutions of matrix differential equations

1995

Abstract In this paper, we construct analytical approximate solutions of initial value problems for the matrix differential equation X ′( t ) = A ( t ) X ( t ) + X ( t ) B ( t ) + L ( t ), with twice continuously differentiable functions A ( t ), B ( t ), and L ( t ), continuous. We determine, in terms of the data, the existence interval of the problem. Given an admissible error e, we construct an approximate solution whose error is smaller than e uniformly, in all the domain.

Matrix differential equationDifferential equationNumerical solutionSpline functionMathematical analysisMinimax approximation algorithmComputational MathematicsSpline (mathematics)Matrix (mathematics)Initial value problemComputational Theory and MathematicsModelling and SimulationMatrix differential equationModeling and SimulationError boundInitial value problemApproximate solutionLinear equationMathematicsComputers & Mathematics with Applications
researchProduct

Discrete Maximum Principle for Galerkin Finite Element Solutions to Parabolic Problems on Rectangular Meshes

2004

One of the most important problems in numerical simulation is the preservation of qualitative properties of solutions of mathematical models. For problems of parabolic type, one of such properties is the maximum principle. In [5], Fujii analyzed the discrete analogue of the (continuous) maximum principle for the linear parabolic problems, and derived sufficient conditions guaranteeing its validity for the Galerkin finite element approximations built on simplicial meshes. In our paper, we present the sufficient conditions for the validity of the discrete maximum principle for the case of bilinear finite element space approximations on rectangular meshes.

Maximum principleComputer simulationMathematical modelDiscontinuous Galerkin methodBilinear interpolationApplied mathematicsPolygon meshGalerkin methodFinite element methodMathematics
researchProduct

Experimental study on triangular central baffle flume

2019

Abstract In this paper the results of the experiments performed to study the flow through a Triangular Central Baffle Flume (TCBF) are reported. The investigated flume consists of a triangular baffle of the apex angle of 75° with a given base width. The theoretical stage-discharge formula was deduced by applying the Buckingham's Theorem and incomplete self-similarity hypothesis and was calibrated using the laboratory measurements carried out in this investigation. The proposed stage-discharge formula is characterized by a mean absolute relative error of 7.4% and 72% of the data points are in an error range of ±5%. The results indicate that TCBF flume is characterized by a flow capacity high…

Mean absolute relative errorFlow (psychology)0207 environmental engineeringStage-discharge formulaBaffle02 engineering and technologyMechanicsSubmergence threshold01 natural sciencesComputer Science Applications010309 opticsFlumeTriangular central baffle flumeModeling and Simulation0103 physical sciencesRange (statistics)Flow capacitySettore AGR/08 - Idraulica Agraria E Sistemazioni Idraulico-ForestaliBuckingham theoremElectrical and Electronic EngineeringIncomplete self-similarity020701 environmental engineeringInstrumentationContraction ratioMathematicsFlow Measurement and Instrumentation
researchProduct

TOPS-MODE approach for the prediction of blood-brain barrier permeation.

2004

The blood-brain barrier permeation has been investigated by using a topological substructural molecular design approach (TOPS-MODE). A linear regression model was developed to predict the in vivo blood-brain partitioning coefficient on a data set of 119 compounds, treated as the logarithm of the blood-brain concentration ratio. The final model explained the 70% of the variance and it was validated through the use of an external validation set (33 compounds of the 119, MAE = 0.33), a leave-one-out crossvalidation (q(2) = 0.65, S(press) = 0.43), fivefold full crossvalidation (removing 28 compounds in each cycle, MAE = 33, RMSE = 0.43) and the prediction of +/- values for an external test set …

Mean squared errorLogarithmChemistryPharmaceutical ScienceThermodynamicsPenetration (firestop)PermeationConcentration ratioModels BiologicalPartition coefficientCapillary PermeabilityBlood-Brain BarrierPredictive Value of TestsTest setLinear regressionLinear ModelsComputer SimulationJournal of pharmaceutical sciences
researchProduct

Competing species system as a qualitative model of radiation therapy

2016

To examine complex features of tumor dynamics we analyze a competing-species lattice model that takes into account the competition for nutrients or space as well as interaction with therapeutic factors such as drugs or radiation. Our model might be interpreted as a certain prey–predator system having three trophic layers: (i) the basal species that might be interpreted as nutrients; (ii) normal and tumor cells that consume nutrients, and (iii) therapeutic factors that might kill either nutrient, normal or tumor cells. Using a wide spectrum of parameters we examined survival of our species and tried to identify the corresponding dynamical regimes. It was found that the radiotherapy influence…

Mean-field approximationPrey–predator systemsTumor growthMonte Carlo simulationsPhysica A : Statistical Mechanics and Its Applications
researchProduct

Classifying efficient alternatives in SMAA using cross confidence factors

2006

Abstract Stochastic multicriteria acceptability analysis (SMAA) is a family of methods for aiding multicriteria group decision making. These methods are based on exploring the weight space in order to describe the preferences that make each alternative the most preferred one. The main results of the analysis are rank acceptability indices, central weight vectors and confidence factors for different alternatives. The rank acceptability indices describe the variety of different preferences resulting in a certain rank for an alternative; the central weight vectors represent the typical preferences favouring each alternative; and the confidence factors measure whether the criteria data are suff…

Measure (data warehouse)Decision support systemInformation Systems and ManagementGeneral Computer ScienceOperations researchStochastic modellingbusiness.industryLow ConfidenceRank (computer programming)Management Science and Operations ResearchMachine learningcomputer.software_genreIndustrial and Manufacturing EngineeringVariety (cybernetics)Group decision-makingModeling and SimulationData envelopment analysisArtificial intelligencebusinesscomputerMathematicsEuropean Journal of Operational Research
researchProduct