Search results for "Computational Mathematic"

showing 10 items of 987 documents

New special function recurrences giving new indefinite integrals

2018

ABSTRACTSequences of new recurrence relations are presented for Bessel functions, parabolic cylinder functions and associated Legendre functions. The sequences correspond to values of an integer variable r and are generalizations of each conventional recurrence relation, which correspond to r=1. The sequences can be extended indefinitely, though the relations become progressively more intricate as r increases. These relations all have the form of a first-order linear inhomogeneous differential equation, which can be solved by an integrating factor. This gives a very general indefinite integral for each recurrence. The method can be applied to other special functions which have conventional …

Pure mathematicsRecurrence relationDifferential equationApplied Mathematics010102 general mathematics010103 numerical & computational mathematicsParabolic cylinder functionFunction (mathematics)01 natural sciencesLegendre functionIntegrating factorsymbols.namesakeSpecial functionssymbols0101 mathematicsAnalysisBessel functionMathematicsIntegral Transforms and Special Functions
researchProduct

A multiscale approach to liquid flows in pipes I: The single pipe

2012

Abstract In the present paper we study the propagation of pressure waves in a barotropic flow through a pipe, with a possibly varying cross-sectional area. The basic model is the Saint–Venant system. We derive two multiscale models for the cases of weak and strong damping, respectively, which describe the time evolution of the piezometric head and the velocity. If the damping is weak, then the corresponding first-order hyperbolic system is linear but contains an additional integro-differential equation that takes into account the damping. In the case of strong damping, the system is nonlinear. The full and multiscale models are compared numerically; we also discuss results obtained by a lar…

PhysicsPipe flowWater hammerApplied MathematicsTime evolutionMechanicsPipe flow; Saint-Venant equations; multiscale analysis; water-hammer; pressure wavesmultiscale analysisPipe flowwater-hammerComputational MathematicsNonlinear systemHydraulic headFlow (mathematics)pressure wavesBarotropic fluidSaint-Venant equationsShallow water equationsSimulation
researchProduct

Network structure and optimal technological innovation

2019

The role of networks in the emergence, diffusion and evolution of technological innovations has attracted much theoretical and empirical attention. Yet, much of the work has explored the role of undirected and homogeneous networks. In real cases, many networks are directed. The flow of information, benefits or observations is directed from one node towards another node. Real networks are also heterogeneous, for example, few nodes have a high degree while many others have a low degree. In this article, we report on the results of an evolutionary agent-based model in which a group of agents, in our case firms, collectively search a complex (rugged) technological landscape and observe each oth…

Computational Mathematicsobservation probabilityControl and Optimizationfitness landscapeComputer Networks and CommunicationsFitness landscapeComputer scienceApplied MathematicsNetwork structuredegree heterogeneityManagement Science and Operations ResearchIndustrial organizationnetwork efficiency
researchProduct

Splineapproximationen von beliebigem Defekt zur numerischen L�sung gew�hnlicher Differentialgleichungen. Teil III

1980

In the first part [5] a general procedure is presented to obtain polynomial spline approximations of arbitrary defect for the solution of the initial value problem of ordinary differential equations. The essential result is a divergence theorem in dependence of the polynomial degree and the defect of the spline functions. In this second part the convergent procedures are investigated and two convergence theorems are proved. Furthermore the question is treated, whether the convergent procedures are appropriate for the numerical solution of stiff equations. The paper is finished by a convergence theorem for a procedure producing spline approximations in a natural way by the discrete approxima…

Computational MathematicsSpline (mathematics)Approximations of πApplied MathematicsNumerical analysisOrdinary differential equationMathematical analysisDivergence theoremInitial value problemDegree of a polynomialMathematicsNumerische Mathematik
researchProduct

A damping preconditioner for time-harmonic wave equations in fluid and elastic material

2009

A physical damping is considered as a preconditioning technique for acoustic and elastic wave scattering. The earlier preconditioners for the Helmholtz equation are generalized for elastic materials and three-dimensional domains. An algebraic multigrid method is used in approximating the inverse of damped operators. Several numerical experiments demonstrate the behavior of the method in complicated two-dimensional and three-dimensional domains. peerReviewed

Algebraic multigrid methodPhysics and Astronomy (miscellaneous)Helmholtz equationGMRESNavier equationMathematics::Numerical AnalysisMultigrid methodHelmholtz equationäärellisten elementtien menetelmäMathematicsElastic scatteringNumerical AnalysisNavierin yhtälöPreconditionerApplied MathematicsMathematical analysispohjustinAcoustic waveWave equationAlgebrallinen multigrid-menetelmäHelmholzin yhtälöGeneralized minimal residual methodComputer Science::Numerical AnalysisFinite element methodComputer Science ApplicationselementtimenetelmäComputational MathematicsClassical mechanicsModeling and SimulationPreconditioner
researchProduct

DRUDIT: Web-based DRUgs DIscovery Tools to design small molecules as modulators of biological targets

2019

Abstract Motivation New in silico tools to predict biological affinities for input structures are presented. The tools are implemented in the DRUDIT (DRUgs DIscovery Tools) web service. The DRUDIT biological finder module is based on molecular descriptors that are calculated by the MOLDESTO (MOLecular DEScriptors TOol) software module developed by the same authors, which is able to calculate more than one thousand molecular descriptors. At this stage, DRUDIT includes 250 biological targets, but new external targets can be added. This feature extends the application scope of DRUDIT to several fields. Moreover, two more functions are implemented: the multi- and on/off-target tasks. These tool…

Statistics and ProbabilityService (systems architecture)PolypharmacologyComputer scienceIn silicoMachine learningcomputer.software_genre01 natural sciencesBiochemistrybiological target finderdrug discoveryMolecular descriptors03 medical and health sciencesMolecular descriptorSettore BIO/10 - BiochimicaWeb applicationComputer SimulationPolypharmacologyMolecular Biology030304 developmental biologySettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniInternet0303 health sciencesbusiness.industrySmall moleculeSettore CHIM/08 - Chimica Farmaceutica0104 chemical sciencesComputer Science Applications010404 medicinal & biomolecular chemistryComputational MathematicsComputational Theory and MathematicsBiological targetThe InternetArtificial intelligencebusinesscomputerSoftware
researchProduct

Functional A Posteriori Error Estimates for Time-Periodic Parabolic Optimal Control Problems

2015

This article is devoted to the a posteriori error analysis of multiharmonic finite element approximations to distributed optimal control problems with time-periodic state equations of parabolic type. We derive a posteriori estimates of the functional type, which are easily computable and provide guaranteed upper bounds for the state and co-state errors as well as for the cost functional. These theoretical results are confirmed by several numerical tests that show high efficiency of the a posteriori error bounds. peerReviewed

Mathematical optimizationControl and OptimizationMathematicsofComputing_NUMERICALANALYSISFinite element approximations010103 numerical & computational mathematicsType (model theory)01 natural sciencesparabolic time-periodic optimal control problemsError analysisFOS: MathematicsApplied mathematicsMathematics - Numerical AnalysisNumerical testsfunctional a posteriori error estimates0101 mathematicsMathematics - Optimization and Control49N20 35Q61 65M60 65F08Mathematicsta113Time periodicta111Numerical Analysis (math.NA)State (functional analysis)Optimal controlComputer Science Applications010101 applied mathematicsOptimization and Control (math.OC)multiharmonic finite element methodsSignal ProcessingA priori and a posterioriAnalysisNumerical Functional Analysis and Optimization
researchProduct

Can aromaticity be connected with molecular polarizability? A theoretical study of benzene isomers and five-membered heterocyclic molecules

2004

Extended calculations of molecular electric dipole polarizability tensor, at Hartree-Fock and correlated level of accuracy (MP2, CCS, CC2, CCSD, and CCSD(T)) have been carried out to investigate whether aromaticity could be related to the electric dipole polarizability of planar ring systems. The calculations prove the exaltation of the average property of conjugated molecules, which is possibly due to their easily polarizable π-electron cloud. On the other hand, theoretical out-of-plane polarizability components are smaller in benzene than in any other C$_6$H$_6$ isomer. The aromatic stabilization energies of monosubstituted five-membered conjugated cyclic molecules increase in the same di…

General EngineeringAromaticityaromaticityfive-membered heterocyclic moleculesConjugated systemRing (chemistry)Polarizability tensorpolarizabilityComputer Science ApplicationsComputational Mathematicschemistry.chemical_compoundDipolechemistryPolarizabilityComputational chemistryPhysics::Atomic and Molecular ClustersMoleculePhysics::Atomic PhysicsPhysics::Chemical Physicsaromaticity; polarizability; five-membered heterocyclic molecules.Benzene
researchProduct

INCIDENCE CONSTRAINTS: A COMBINATORIAL APPROACH

2006

The simplest geometric constraints are incidences between points and lines in the projective plane. This problem is universal, in the sense that all algebraic systems reduce to such geometric constraints. Detecting incidence dependences between these geometric constraints is NP-complete. New methods to prove incidence theorems are proposed, which use strictly no computer algebra but only combinatorial arguments.

Discrete mathematicsIncidence geometryApplied MathematicsCombinatorial proofSymbolic computationTheoretical Computer ScienceAlgebraComputational MathematicsComputational Theory and MathematicsGeometry and TopologyProjective planeAlgebraic numberIncidence (geometry)MathematicsProjective geometryInternational Journal of Computational Geometry & Applications
researchProduct

Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants

2018

We consider extensions of the two-variable guarded fragment, GF2, where distinguished binary predicates that occur only in guards are required to be interpreted in a special way (as transitive relations, equivalence relations, pre-orders or partial orders). We prove that the only fragment that retains the finite (exponential) model property is GF2 with equivalence guards without equality. For remaining fragments we show that the size of a minimal finite model is at most doubly exponential. To obtain the result we invent a strategy of building finite models that are formed from a number of multidimensional grids placed over a cylindrical surface. The construction yields a 2NExpTime-upper bou…

FOS: Computer and information sciencesComputer Science - Logic in Computer ScienceTwo-variable logicGeneral Computer ScienceComputational complexity theoryLogicguarded fragmentBinary number0102 computer and information sciences01 natural sciencesUpper and lower boundsTheoretical Computer ScienceCombinatoricstransitive relationEquivalence relationfinite satisfiability problem0101 mathematicsEquivalence (formal languages)Integer programmingMathematicsDiscrete mathematicsTransitive relationNEXPTIMEcomputational complexity010102 general mathematicsLogic in Computer Science (cs.LO)Computational Mathematics010201 computation theory & mathematicsequivalence ralationACM Transactions on Computational Logic
researchProduct