Search results for "series"

showing 10 items of 1193 documents

The Interaction of Intravenous and Oral Biliary Contrast Agents with Serum Albumins

1978

The binding of two homologous series of oral and intravenous biliary contrast agents to human and bovine serum albumin was investigated using the gel filtration technique and circular dichroism measurements.

Circular dichroismChromatographybiologyChemistrymedia_common.quotation_subjectSize-exclusion chromatographyHuman serum albuminHomologous serieschemistry.chemical_compoundFlufenamic acidmedicinebiology.proteinContrast (vision)Bovine serum albuminmedicine.drugmedia_common
researchProduct

Stochastic models for wind speed forecasting

2011

Abstract This paper is concerned with the problem of developing a general class of stochastic models for hourly average wind speed time series. The proposed approach has been applied to the time series recorded during 4 years in two sites of Sicily, a region of Italy, and it has attained valuable results in terms both of modelling and forecasting. Moreover, the 24 h predictions obtained employing only 1-month time series are quite similar to those provided by a feed-forward artificial neural network trained on 2 years data.

Class (computer programming)EngineeringSeries (mathematics)Artificial neural networkMeteorologyRenewable Energy Sustainability and the EnvironmentStochastic modellingbusiness.industryModel selectionSettore FIS/01 - Fisica SperimentaleEnergy Engineering and Power TechnologySettore FIS/03 - Fisica Della MateriaSettore FIS/07 - Fisica Applicata(Beni Culturali Ambientali Biol.e Medicin)Wind speedFuel TechnologyNuclear Energy and EngineeringSpectral analysisbusinessstochastic models time series model selection spectral analysis artificial neural networks wind forecastingAlgorithmEnergy Conversion and Management
researchProduct

Guaranteed error bounds and local indicators for adaptive solvers using stabilised space–time IgA approximations to parabolic problems

2019

Abstract The paper is concerned with space–time IgA approximations to parabolic initial–boundary value problems. We deduce guaranteed and fully computable error bounds adapted to special features of such type of approximations and investigate their efficiency. The derivation of error estimates is based on the analysis of the corresponding integral identity and exploits purely functional arguments in the maximal parabolic regularity setting. The estimates are valid for any approximation from the admissible (energy) class and do not contain mesh-dependent constants. They provide computable and fully guaranteed error bounds for the norms arising in stabilised space–time approximations. Further…

Class (set theory)Series (mathematics)Space timeContext (language use)010103 numerical & computational mathematicsType (model theory)01 natural sciencesIdentity (music)010101 applied mathematicsComputational MathematicsComputational Theory and MathematicsModeling and SimulationApplied mathematicsA priori and a posteriori0101 mathematicsEnergy (signal processing)MathematicsComputers & Mathematics with Applications
researchProduct

Computing with Rational Symmetric Functions and Applications to Invariant Theory and PI-algebras

2012

The research of the first named author was partially supported by INdAM. The research of the second, third, and fourth named authors was partially supported by Grant for Bilateral Scientific Cooperation between Bulgaria and Ukraine. The research of the fifth named author was partially supported by NSF Grant DMS-1016086.

Classical Invariant Theory05A15 05E05 05E10 13A50 15A72 16R10 16R30 20G05MacMahon Partition AnalysisHilbert SeriesRational symmetric functions classical invariant theory algebras with polynomial identity cocharacter sequenceMathematics - Rings and AlgebrasCommutative Algebra (math.AC)Mathematics - Commutative AlgebraRational Symmetric FunctionsAlgebras with Polynomial IdentitySettore MAT/02 - AlgebraRings and Algebras (math.RA)Noncommutative Invariant TheoryFOS: MathematicsCocharacter SequenceMathematics - CombinatoricsCombinatorics (math.CO)
researchProduct

A comparison analysis between unsymmetric and symmetric radial basis function collocation methods for the numerical solution of partial differential …

2002

Abstract In this article, we present a thorough numerical comparison between unsymmetric and symmetric radial basis function collocation methods for the numerical solution of boundary value problems for partial differential equations. A series of test examples was solved with these two schemes, different problems with different type of governing equations, and boundary conditions. Particular emphasis was paid to the ability of these schemes to solve the steady-state convection-diffusion equation at high values of the Peclet number. From the examples tested in this work, it was observed that the system of algebraic equations obtained with the symmetric method was in general simpler to solve …

CollocationPartial differential equationSeries (mathematics)Numerical solutionMathematical analysisPartial differential equationAlgebraic equationComputational MathematicsComputational Theory and MathematicsModeling and SimulationCollocation methodModelling and SimulationRadial basis functionBoundary value problemMesh free techniqueMathematicsNumerical partial differential equationsComputers & Mathematics with Applications
researchProduct

The Jordan-Hölder theorem and prefrattini subgroups of finite groups

1995

by A. BALLESTER-BOLINCHES and L. M. EZQUERRO(Received 26 January, 1994)Introduction. All groups considered are finite. In recent years a number ofgeneralizations of the classic Jordan-Holder Theorem have been obtained (see [7],Theorem A.9.13): in a finite group G a one-to-one correspondence as in the Jordan-Holder Theorem can be defined preserving not only G-isomorphic chief factors but eventheir property of being Frattini or non-Frattini chief factors. In [2] and [13] a newdirection of generalization is presented: the above correspondence can be defined in sucha way that the corresponding non-Frattini chief factors have the same complement(supplement).In this paper we present a necessary a…

CombinatoricsComplement (group theory)Finite groupConjugacy classGroup (mathematics)Locally finite groupComposition seriesGeneral MathematicsSylow theoremsOrder (group theory)MathematicsGlasgow Mathematical Journal
researchProduct

On partial CAP-subgroups of finite groups

2015

Abstract Given a chief factor H / K of a finite group G, we say that a subgroup A of G avoids H / K if H ∩ A = K ∩ A ; if H A = K A , then we say that A covers H / K . If A either covers or avoids the chief factors of some given chief series of G, we say that A is a partial CAP-subgroup of G. Assume that G has a Sylow p-subgroup of order exceeding p k . If every subgroup of order p k , where k ≥ 1 , and every subgroup of order 4 (when p k = 2 and the Sylow 2-subgroups are non-abelian) are partial CAP-subgroups of G, then G is p-soluble of p-length at most 1.

CombinatoricsDiscrete mathematicsNormal subgroupFinite groupAlgebra and Number TheorySubgroupSylow theoremsChief seriesOrder (group theory)Index of a subgroupMathematicsJournal of Algebra
researchProduct

Poincaré Week in Göttingen, 22–28 April 1909

2018

When Paul Wolfskehl died in 1906, his will established a prize for the first mathematician who could supply a proof of Fermat’s Last Theorem, or give a counterexample refuting it. The interest from this prize money was later used to bring world-renowned mathematicians to Gottingen to deliver a series of lectures. Hilbert was apparently very pleased with this arrangement, and once jested that the only thing that kept him from proving Fermat’s famous conjecture was the thought of killing the goose that laid these golden eggs.

CombinatoricsFermat's Last Theoremsymbols.namesakeConjectureSeries (mathematics)PhilosophyPoincaré conjecturesymbolsCounterexample
researchProduct

Approximation Operators of Binomial Type

1999

Our objective is to present a unified theory of the approximation operators of binomial type by exploiting the main technique of the so- called “ umbral calculus” or “finite operator calculus” (see [18], [20]-[22]). Let us consider the basic sequence (bn)n≥0 associated to a certain delta operator Q. By supposing that b n (x) ≥ 0, x ∈ [0, ∞), our purpose is to put in evidence some approximation properties of the linear positive operators (L Q n ) n≥1 which are defined on C[0,1] by \( L_n^Qf = \sum\limits_{k = 0}^n {\beta _n^Q{,_k}f\left( {\frac{k}{n}} \right),\beta _{n{,_k}}^Q\left( x \right): = } \frac{1}{{{b_n}\left( n \right)}}\left( {\begin{array}{*{20}{c}} n \\ k \end{array}} \right){b_…

CombinatoricsPhysicssymbols.namesakeBinomial typeBinomial approximationsymbolsBinomial numberCentral binomial coefficientDelta operatorGaussian binomial coefficientBinomial seriesBinomial coefficient
researchProduct

A code to evaluate prolate and oblate spheroidal harmonics

1998

Abstract We present a code to evaluate prolate ( P n m ( x ), Q n m ( x ); n ≥ m , x > 1) and oblate ( P n m ( ix ), Q n m ( ix ); n ≥ m , x > 0) spheroidal harmonics, that is, spherical harmonics ( n and m integers) for real arguments larger than one and for purely imaginary arguments. We start from the known values (in closed form) of P m m and P m +1 m and we apply the forward recurrence relation over n up to a given degree n = N Max . The Wronskian relating P 's and Q 's, together with the evaluation of the continued fraction for Q m+N staggeredMax m / Q m+N staggeredMax -1 m , allows the calculation of Q m+N staggeredMax m and Q m+N staggeredMax -1 m . Backward recurrence is then appli…

CombinatoricsRecurrence relationDegree (graph theory)Legendre seriesHardware and ArchitectureWronskianHarmonicsOblate spheroidGeneral Physics and AstronomySpherical harmonicsGeometryProlate spheroidMathematicsComputer Physics Communications
researchProduct