Academic literature on the topic 'Convergence des solutions'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Convergence des solutions.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Convergence des solutions"

1

Hayase, Toshiyuki. "Monotonic Convergence Property of Turbulent Flow Solution With Central Difference and QUICK Schemes." Journal of Fluids Engineering 121, no. 2 (June 1, 1999): 351–58. http://dx.doi.org/10.1115/1.2822213.

Full text
Abstract:
Monotonic convergence of numerical solutions with the computational grid refinement is an essential requirement in estimating the grid-dependent uncertainty of computational fluid dynamics. If the convergence is not monotonic, the solution could be erroneously regarded as convergent at the local extremum with respect to some measure of the error. On the other hand, if the convergence is exactly monotonic, estimation methods such as Richardson extrapolation properly evaluate the uncertainty of numerical solutions. This paper deals with the characterization of numerical schemes based on the property of the monotonic convergence of numerical solutions. Two typical discretization schemes of convective terms were considered; the second-order central difference scheme and the third-order Leonard’s QUICK scheme. A fully developed turbulent flow through a square duct was calculated via a SIMPLER based finite volume method without a turbulence model. The convergence of the numerical solution with the grid refinement was investigated for the mean flow property as well as fluctuations. The comparison of convergence process between the discretization schemes has revealed that the QUICK scheme results in preferable monotonic convergence, while the second-order central difference scheme undergoes non-monotonic convergence. The latter possibly misleads the determination of convergence with the grid refinement, or causes trouble in applying the Richardson extrapolation procedure to estimate the numerical uncertainty.
APA, Harvard, Vancouver, ISO, and other styles
2

Xinfu, Chen, Charlie M. Elliot, Gardiner Andy, and Jennifer Jing Zhao. "Convergence of numerical solutions." Applicable Analysis 69, no. 1-2 (June 1998): 95–108. http://dx.doi.org/10.1080/00036819808840645.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Amleh, A. M., and G. Ladas. "Convergence to periodic solutions." Journal of Difference Equations and Applications 7, no. 4 (January 2001): 621–31. http://dx.doi.org/10.1080/10236190108808292.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Qi. "Application of Optimal Homotopy Analysis Method for Solitary Wave Solutions of Kuramoto-Sivashinsky Equation." Zeitschrift für Naturforschung A 66, no. 1-2 (February 1, 2011): 117–22. http://dx.doi.org/10.1515/zna-2011-1-216.

Full text
Abstract:
In this paper, the optimal homotopy analysis method is applied to find the solitary wave solutions of the Kuramoto-Sivashinsky equation. With three auxiliary convergence-control parameters, whose possible optimal values can be obtained by minimizing the averaged residual error, the method used here provides us with a simple way to adjust and control the convergence region of the solution. Compared with the usual homotopy analysis method, the optimal method can be used to get much faster convergent series solutions.
APA, Harvard, Vancouver, ISO, and other styles
5

Lukas, Mark A. "Convergence rates for regularized solutions." Mathematics of Computation 51, no. 183 (September 1, 1988): 107. http://dx.doi.org/10.1090/s0025-5718-1988-0942146-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kindermann, Stefan. "Projection Methods for Ill-Posed Problems Revisited." Computational Methods in Applied Mathematics 16, no. 2 (April 1, 2016): 257–76. http://dx.doi.org/10.1515/cmam-2015-0036.

Full text
Abstract:
AbstractWe consider the discretization of least-squares problems for linear ill-posed operator equations in Hilbert spaces. The main subject of this article concerns conditions for convergence of the associated discretized minimum-norm least-squares solution to the exact solution using exact attainable data. The two cases of global convergence (convergence for all exact solutions) or local convergence (convergence for a specific exact solution) are investigated. We review the existing results and prove new equivalent conditions when the discretized solution always converges to the exact solution. An important tool is to recognize the discrete solution operator as an oblique projection. Hence, global convergence can be characterized by certain subspaces having uniformly bounded angles. We furthermore derive practically useful conditions when this holds and put them into the context of known results. For local convergence, we generalize results on the characterization of weak or strong convergence and state some new sufficient conditions. We furthermore provide an example of a bounded sequence of discretized solutions which does not converge at all, not even weakly.
APA, Harvard, Vancouver, ISO, and other styles
7

Diblík, J., M. Růžičková, Z. Šmarda, and Z. Šutá. "Asymptotic Convergence of the Solutions of a Dynamic Equation on Discrete Time Scales." Abstract and Applied Analysis 2012 (2012): 1–20. http://dx.doi.org/10.1155/2012/580750.

Full text
Abstract:
The paper investigates a dynamic equationΔy(tn)=β(tn)[y(tn−j)−y(tn−k)]forn→∞, wherekandjare integers such thatk>j≥0, on an arbitrary discrete time scaleT:={tn}withtn∈ℝ,n∈ℤn0−k∞={n0−k,n0−k+1,…},n0∈ℕ,tn<tn+1,Δy(tn)=y(tn+1)−y(tn), andlimn→∞tn=∞. We assumeβ:T→(0,∞). It is proved that, for the asymptotic convergence of all solutions, the existence of an increasing and asymptotically convergent solution is sufficient. Therefore, the main attention is paid to the criteria for the existence of an increasing solution asymptotically convergent forn→∞. The results are presented as inequalities for the functionβ. Examples demonstrate that the criteria obtained are sharp in a sense.
APA, Harvard, Vancouver, ISO, and other styles
8

Feireisl, Eduard. "Time-periodic solutions of a quasilinear beam equation via accelerated convergence methods." Applications of Mathematics 33, no. 5 (1988): 362–73. http://dx.doi.org/10.21136/am.1988.104317.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Mikhailov, Mikhail D., and Renato M. Cotta. "CONVERGENCE ACCELERATION OF INTEGRAL TRANSFORM SOLUTIONS." Hybrid Methods in Engineering 3, no. 1 (2001): 6. http://dx.doi.org/10.1615/hybmetheng.v3.i1.70.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gheorghe, Gabriel, and Daniel Craciun. "SMART GRID / SMART METERING CONVERGENCE SOLUTIONS." EMERG - Energy. Environment. Efficiency. Resources. Globalization 6, no. 1 (2020): 11–29. http://dx.doi.org/10.37410/emerg.2020.1.01.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Convergence des solutions"

1

Brandén, Henrik. "Convergence Acceleration for Flow Problems." Doctoral thesis, Uppsala universitet, Avdelningen för teknisk databehandling, 2001. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-576.

Full text
Abstract:
Convergence acceleration techniques for the iterative solution of system of equations arising in the discretisations of compressible flow problems governed by the steady state Euler or Navier-Stokes equations is considered. The system of PDE is discretised using a finite difference or finite volume method yielding a large sparse system of equations. A solution is computed by integrating the corresponding time dependent problem in time until steady state is reached. A convergence acceleration technique based on semicirculant approximations is applied. For scalar model problems, it is proved that the preconditioned coefficient matrix has a bounded spectrum well separated from the origin. A very simple time marching scheme such as the forward Euler method can be used, and the time step is not limited by a CFL-type criterion. Instead, the time step can asymptotically be chosen as a constant, independent of the number of grid points and the Reynolds number. Numerical experiments show that grid and parameter independent convergence is achieved also in more complicated problem settings. A comparison with a multigrid method shows that the semicirculant convergence acceleration technique is more efficient in terms of arithmetic complexity. Another convergence acceleration technique based on fundamental solutions is proposed. An algorithm based on Fourier technique is provided for the fast application. Scalar model problems are considered and a theory, where the preconditioner is represented as an integral operator is derived. Theory and numerical experiments show that for first order partial differential equations, grid independent convergence is achieved.
APA, Harvard, Vancouver, ISO, and other styles
2

Liceaga, Daniel Olmos. "Pseudospectral solutions of reaction-diffusion equations that model excitable media : convergence of solutions and applications." Thesis, University of British Columbia, 2007. http://hdl.handle.net/2429/31453.

Full text
Abstract:
In this thesis, I develop accurate and efficient pseudospectral methods to solve Fisher's, the Fitzhugh-Nagumo and the Beeler-Reuter equations. Based on these methods, I present a study of spiral waves and their interaction with a boundary. The solutions of Fisher's equation are characterized by propagating fronts with a, shock-like wave behavior when large values of the reaction rate coefficient is taken. The pseudospectral method employed for its solution is based on Chebyshev-Gauss-Lobatto quadrature points. I compare results for a single domain as well as for a subdivision of the main domain into subintervals. Instabilities that occur in the numerical solution for a single domain, analogous to those found by others, are attributed to round-off errors arising from numerical features of the discrete second derivative matrix operator. However, accurate stable solutions of Fisher's equation are obtained with a multidomain pseudospectral method. A detailed comparison of the present approach with the use of the sinc interpolation is also carried out. Also, I present a study of the convergence of different numerical schemes in the solution of the Fitzhugh-Nagumo equations. These equations, have spatial and temporal dynamics in two different scales and the solutions exhibit shock-like waves. The numerical schemes employed are Chebyshev multidomain, Fourier pseudospectral, finite difference methods and in particular a method developed by Barkley. I consider two different models of the local dynamics. I present results for plane wave propagation in one dimension and spiral waves for two dimensions. I use an operator splitting method with the Chebyshev multidomain approach in order to reduce the computational time. I conclude this thesis by presenting a study of the interaction of a meandering spiral wave with a boundary, where the Beeler-Reuter model is considered. The phenomenon of annihilation or reflection of a spiral at the boundaries of the domain is studied, when the trajectory of the tip of a spiral wave is essentially linear. This phenomenon is analyzed in terms of the variable j, which controls the reactivation of the sodium channel in the Beeler-Reuter model.
Science, Faculty of
Mathematics, Department of
Graduate
APA, Harvard, Vancouver, ISO, and other styles
3

McKee, Alex Clive Seymoore. "Analytical solutions of orientation aggregation models, multiple solutions and path following with the Adomian decomposition method." Thesis, Brunel University, 2011. http://bura.brunel.ac.uk/handle/2438/7349.

Full text
Abstract:
In this work we apply the Adomian decomposition method to an orientation aggregation problem modelling the time distribution of filaments. We find analytical solutions under certain specific criteria and programmatically implement the Adomian method to two variants of the orientation aggregation model. We extend the utility of the Adomian decomposition method beyond its original capability to enable it to converge to more than one solution of a nonlinear problem and further to be used as a corrector in path following bifurcation problems.
APA, Harvard, Vancouver, ISO, and other styles
4

Miller, Joel. "Rates of Convergence to Self-Similar Solutions of Burgers' Equation." Scholarship @ Claremont, 2000. https://scholarship.claremont.edu/hmc_theses/123.

Full text
Abstract:
Burgers’ Equation ut + cuux = νuxx is a nonlinear partial differential equation which arises in models of traffic and fluid flow. It is perhaps the simplest equation describing waves under the influence of diffusion. We consider the large time behavior of solutions with exponentially localized initial conditions, analyzing the rate of convergence to a known self similar single-hump solution. We use the Cole-Hopf Transformation to convert the problem into a heat equation problem with exponentially localized initial conditions. The solution to this problem converges to a Gaussian. We then find an optimal Gaussian approximation which is accurate to order t−2. Transforming back to Burgers’ Equation yields a solution accurate to order t−2.
APA, Harvard, Vancouver, ISO, and other styles
5

Sakib, M. Shahab. "Hastening convergence of the orthotropic plate solutions of bridge deck analysis." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0011/MQ53380.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Njoroge, Kahira Albert. "Convergence of deep learning and high performance computing: challenges and solutions." Doctoral thesis, Universitat Politècnica de Catalunya, 2021. http://hdl.handle.net/10803/672417.

Full text
Abstract:
Deep Learning has achieved outstanding results in many fields and led to groundbreaking discoveries. With the steady increase in datasets and model sizes, there has been a recent surge in Machine Learning applications in High-Performance Computing (HPC) to speed up training. Deep Neural Network (DNN) frameworks use distributed training to enable faster time to convergence and alleviate memory capacity limitations when training large models or using high dimension inputs. However, training DNN in HPC infrastructures presents a unique set of challenges: scalability, IO contention, network congestion and fault tolerance. Solving these problems is particularly challenging and unique due to DL applications’ nature and the history of adaptation of DL in HPC. This thesis addresses scalability and resilience challenges by looking at different parts of the Machine Learning Workflow. We first address hyper-parameters optimisation (HPO), which is one of the most time consuming and resource-intensive parts of a Machine Learning Workflow. We present a HPO scheme built on top of PyCOMPSs, a programming model and runtime which aims to ease the development of parallel applications for distributed infrastructures. We show that PyCOMPSs is a robust framework that can accelerate the process of Hyperparameter Optimisation across multiple devices and computing units. We perform a detailed performance analysis showing different configurations to demonstrate the effectiveness of our approach. We then analyse the compute, communication, and memory requirements of DNNs to understand the trade-offs of different parallelism approaches on performance and scalability. We leverage our model-driven analysis to be the basis for an oracle utility that can help detect the limitations and bottlenecks of different parallelism approaches at scale. While significant effort has been put to facilitate distributed training by DL frameworks,fault tolerance has been largely ignored. We examine the checkpointing implementation of popular DL platforms. We evaluate the computational cost of checkpointing, file formats and file sizes, the impact of scale, and deterministic checkpointing. We provide discussion points that can aid users in selecting a fault-tolerant framework to use in HPC. We also provide take-away points that framework developers can use to facilitate better checkpointing of DL workloads in HPC.
El Deep Learning ha logrado resultados sobresalientes en muchas aplicaciones y ha dado lugar a descubrimientos revolucionarios. Con el aumento constante del tamaño de las colecciones de datos y de los modelos, ha habido un reciente desarrollo de aplicaciones de Machine Learning en computación de alto rendimiento (HPC) que se enfocan en reducir el tiempo de entrenamiento de los modelos diseñados. Las librerías de Deep Neural Networks (DNN) utilizan el entrenamiento distribuido para reducir el tiempo de convergencia y aliviar las limitaciones de capacidad de memoria al entrenar modelos grandes o al utilizar entradas de gran dimensión. Sin embargo, capacitar a DNN en infraestructuras de HPC presenta una serie única de desafíos: escalabilidad, contención de E/S, congestión de la red y tolerancia a fallas. Resolver estos problemas es particularmente desafiante y único debido a la naturaleza de las aplicaciones DL y la historia de adaptación de DL en HPC. Esta tesis aborda los desafíos de escalabilidad y resiliencia al analizar el flujo de trabajo completo del Machine Learning. Primero abordamos la optimización de hiper-parámetros (HPO), que es una de las partes del flujo de trabajo de Machine Learning que consume más tiempo y recursos. Presentamos un esquema HPO construido sobre PyCOMPSs, un modelo de programación que tiene como objetivo facilitar el desarrollo de aplicaciones paralelas para infraestructuras distribuidas. Demostramos que PyCOMPSs es un marco robusto que puede acelerar el proceso de optimización de hiper-parámetros en múltiples dispositivos y unidades informáticas. Realizamos un detallado análisis de rendimiento que muestra diferentes configuraciones para demostrar la efectividad de nuestro enfoque. Luego, analizamos los requisitos de computación, comunicación y memoria de las DNN para comprender las compensaciones de los diferentes enfoques de paralelismo en el rendimiento y la escalabilidad. Aprovechamos nuestro análisis basado en modelos como base de una utilidad de Oracle que puede ayudar a detectar las limitaciones y los cuellos de botella de diferentes enfoques de paralelismo a escala. Si bien se ha realizado un esfuerzo significativo para facilitar el entrenamiento distribuido por los marcos de DL, la tolerancia a fallas se ha ignorado en gran medida. Examinamos la implementación de puntos de control de plataformas DL populares. Evaluamos el costo computacional de los puntos de control, los formatos y tamaños de los archivos, el impacto de la escala y los puntos de control deterministas. Proporcionamos puntos de discusión que pueden ayudar a los usuarios a seleccionar un marco tolerante a fallas para usar en HPC. También proporcionamos puntos de referencia que los desarrolladores de marcos pueden utilizar para facilitar un mejor control de las cargas de trabajo de DL en HPC.
Arquitectura de computadors
APA, Harvard, Vancouver, ISO, and other styles
7

Zaiter, Ibtissame. "Sur quelques équations dispersives." Paris 11, 2007. http://www.theses.fr/2007PA112247.

Full text
Abstract:
Dans le cadre de ma thèse , on a étudié quelques types d'équations dispersives telles que le système de Boussinesq, l'équation de Benjamin et l'équation d'Ostrovsky. On démontre quelques résultats d'existence et de non existence du problème de Cauchy associé à un cas particulier du système de Boussinesq. Pour l'équation de Benjamin, on traite le caractère mal posé du problème de Cauchy ainsi que la contrainte de masse nulle. Un deuxième but est d'étudier les ondes solitaires: existence, non existence, régularité, symétrie, comportement à l'infini et convergence vers les ondes solitaires de l'équation de KPI. On considère le problème de Cauchy de l'équation d'Ostrovsky. On prouve un résultat d'existence locale et globale puis on démontre la convergence des solutions vers celles de l'équation de KdV lorsque le paramètre de rotation tend vers zéro, On étudie aussi le caractère mal posé de cette équation
In this thesis, we study some few type of dispersive equations. First, we establish the well and ill-posedness of the Cauchy problem associated to a particular case of the Boussinesq system, in dimension 1 and 2. We study also the Cauchy problem of the 2D Benjamin equation and we show that any solution satisfies the zero mass constraint without necessary satisfying by the initial data. The last part of this chapter is devoted to the study of the solitary waves associated to the 2D Benjamin equation: existence and non existence, regularity, symmetry, algebraic decay at infinity and their convergence to the solitary waves of the KPI equation. In the last chapter, we study the well and ill-posedness of the Cauchy problem associated to the Ostrovsky equation. We prove also the convergence of these solutions to that of the KdV equation as the rotation parameter goes to zero
APA, Harvard, Vancouver, ISO, and other styles
8

Hacklin, Fredrik August. "A 3G Convergence Strategy for Mobile Business Middleware Solutions : Applications and Implications." Thesis, KTH, Mikroelektronik och Informationsteknik, IMIT, 2001. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-93278.

Full text
Abstract:
Mobile business solutions are one of the most attractive market segments of mobile information services. The third generation of mobile communication systems (3G) will be a significant step forward in the convergence of telecommunications and datacommunications industries. More specifically, the convergence of mobile technologies and the Internet allows compelling possibilities for future applications and solutions. However, most current mobile businesses and mobile application and solution providers are rather contributing to the process of convergence; many current ideas and solutions are based on the restrictions of existing mobile networks combined with Internet-based services. In the future, when mobile networks and the Internet have merged, it will no longer be possible to create revenue with these types of solutions. One concrete solution is the mobile middleware concept, bridging the mobile technologies and Internet world. This Master’s thesis studies the middleware concept for providing business applications in the light of 3G, making strategic recommendations to a provider of these kinds of services. A comprehensive discussion about the developments after 3G is introduced. Alternative solutions are presented and some strategic implications are introduced. The implications are motivated by an industry survey, carried out within this project. The topic of over-the-air data synchronization is discussed as an example for interim middleware. Mobile computing file system issues are seen as an interesting opportunity for business applications. The possibility of remote desktop screen access is studied, and measurements proving its feasability for hosted wireless application service provision are made. Emerging mobile Java technologies are discussed as an efficient platform for providing ubiquitous, device independent end-to-end solutions. As one of the recommended strategies, this thesis introduces the concept of hybrid thickness client applications as a feasible solution for migrating from current middleware solutions to an (uncertain) future of native, thick terminal applications, within a scope of two years. Based on this concept, a prototype for a 3G smartphone application was developed as an example. A set of possible strategic scenarios is presented and discussed. This thesis also discusses operator differentiation and business solutions in an all-IP based world. 3G networks and handset devices will introduce a large number of new applications and business opportunities, but such a change will also introduce new challenges and risks. The migration challenge is being illustrated in the case of Smartner, a mobile middleware solution provider focusing on business applications. As shown by this case, compared to current enabling solutions, a major shift in technologies is seen as needed, in order to maintain long-term success.
Mobila affärssystem bildar ett av de mest attraktiva marknadssegment inom mobila informationstjänster. Den tredje generationens mobila kommunikationssytem (3G) kommer att bli ett viktigt steg fram mot konvergensen mellan telekommunikationsoch datakommunikationsindustrin. Särskilt konvergensen som äger rum mellan mobila teknologier och Internet erbjuder utmanande möjligheter för framtida applikationer och lösningar. De flesta nuvarande företag och tjänster inom mobilbranschen kan dock snarast betraktas som ett bidrag till denna konvergens. Många av de nuvarande idéerna och lösningarna är nämligen baserade på avgränsningar och problem som uppstår vid kombination av mobila system med Internet-baserade tjänster. I framtiden, när mobila nät har vuxit ihop med Internet till en symbios, kommer det inte längre att vara möjligt att förtjäna på detta slag av lösningar. En konkret lösning är det mobila middleware-konceptet, som bildar en logisk koppling mellan mobila teknologier och Internet-världen. Detta examensarbete studerar middleware-konceptet från en 3G-orienterad synvinkel och framför strategiska råd för företag som erbjuder detta slag av tjänster. En detaljerad diskussion om utvecklingen efter 3G presenteras. Arbetet lägger fram alternativa lösningar och strategiska implikationer deriveras. Implikationerna är motiverade bl.a. av en intervjuunders ökning som utfördes i samband med detta arbete. Temat trådlös datasynkronisering diskuteras som ett exempel för provisorisk middleware. Mobila filsystem införs som en intressant möjlighet för affärsapplikationer. Diverse möjligheter för fjärrkontroll av en arbetsplatsstation studeras och mätningar bevisar deras genomförbarhet för trådlösa applikationstjänster. Framträdande mobila Java-teknologier analyseras och presenteras som ett efficient underlag för plattformoberoende end-to-end-lösningaröver lag. En av de rekommenderade strategierna är baserad på det hybrida klientkonceptet, vilket presenteras som en realistisk lösning förövergången från nuvarande middleware-system till en (osäker) framtid av nativa, tjocka terminalapplikationer. Den strategiska horisonten för detta är två år. Utgående från detta koncept utvecklades en prototyp som exempel för en sådan applikation. Arbetet definerar och diskuterar dessutom diverse strategiska scenarier. Slutligen nämns problematiken om operatörernas framtida differentieringsmöjligheter och rollen av affärssystem i en fullständigt IP-baserad värld. 3G nät och terminaler kommer att skapa ett stort antal nya användningar och affärsmöjligheter, men ändringen kommer också att medföra nya utmaningar och risker. Detta illustreras med hjälp av företaget Smartner som exempel för en leverant ör av mobila middleware-lösningar för affärsanvändningar. Som demonstrerat i detta fall, anses i jämförelse med nuvarande applikationslösningar en signifikant teknologisk reorientering vara nödvändig, för att bevara ett långvarigt perspektiv.
Langattomat yrityssovellukset ovat nykyään yksi kiinnostavimmista mobiilimarkkinoiden segmenteistä. Kolmannen sukupolven (3G) mobiilit viestintäjärjestelmät tulevat olemaan merkittävä askel kohti telekommunikaatioja dataliikennealojen yhdistymist ä (ns. konvergenssia). Itse asiassa mobiiliteknologian ja Internetin lähentyminen mahdollistaa entistä hyödyllisempien mobiilisovellusten ja -ratkaisuiden rakentamisen tulevaisuudessa. Tällä hetkellä useat mobiiliyritykset ja mobiilisovellusten tuottajat ovat kuitenkin osana tätä yhdistymisprosessia. Monet nykyiset ideat ja ratkaisut ottavat nimittäin lähtökohdakseen rajoitukset, joita nykyiset tietoliikenneverkot asettavat yhdistyessään Internet-pohjaisiin palveluihin. Tulevaisuudessa, kun mobiiliverkot ja Internet ovat yhdistyneet, ei ole enää mahdollista ansaita rahaa tällaisten perinteisten ratkaisuiden avulla. Yksi konkreettinen ratkaisumalli perustuu mobile middleware -käsitteeseen, joka liittää yhteen mobiiliteknologian ja Internetin. Tässä diplomityössä tutkitaan middleware- käsitettä yrityssovellusten tarjoamisessa erityisesti 3G-verkoissa, ja työssä esitellään strategisia suosituksia näiden sovelluspalveluiden tarjoajille. Työssä käyd ään perusteellisesti läpi kolmannen sukupolven jälkeistä kehitystä. Vaihtoehtoisia ratkaisuja esitellään, ja joitakin strategisia vaikutuksia tuodaan myös esille. Vaikutuksia perustellaan tuloksilla, joita tämän projektin osana tehty kysely paljasti. Tiedon langatonta synkronisointia tarkastellaan esimerkkinä tilapäisestä middlewaresta. Mobiileihin tiedostojärjestelmiin liittyvät asiat nähdään mielenkiintoisena mahdollisuutena yrityssovelluksille. Toimistojärjestelmien etäkäyttömahdollisuuksia on tutkittu ja niiden sopivuutta langattomaan sovellustarjontaan on mitattu. Kehittyviä mobiileja Java-teknologioita pidetään tehokkaana alustana, jonka avulla voidaan tarjota kaikkialla saatavilla olevia, päätelaiteriippumattomia ratkaisuja loppuasiakkaille. Yhtenä suositelluista strategioista tämä diplomityö esittelee yksinkertaisen päätelaitesovellusmallin, jonka avulla nykyisistä middleware-ratkaisuista voidaan siirtyä tulevaisuuden kehittyneempiin päätelaiteratkaisuihin kahden vuoden sisällä. Tähän konseptiin perustuen työssä on kehitetty esimerkki 3G-älypuhelimen sovelluksesta. Lisäksi esitellään ja arvioidaan mahdollisia strategisia skenaariovaihtoehtoja. Tämä diplomityö käsittelee myös operaattoreiden differointimahdollisuuksia ja yrityssovelluksia täysin IP-pohjaisissa verkoissa. 3G-verkot ja -päätelaitteet tuovat mukanaan laajan valikoiman uusia sovelluksia ja liiketoimintamahdollisuuksia, mutta tämä muutos merkitsee myös uusia haasteita ja riskejä. Tätä haastetta kuvataan tutkimuksen esimerkkiyrityksen Smartnerin tapauksessa, joka on yrityssovelluksiin fokusoitunut mobiilien middleware-ratkaisuiden tarjoaja. Tutkimus tuo esille, miten Smartnerin nykyiset sovellukset huomioon ottaen tarvitaan valtava teknologinen suunnanmuutos pitkäaikaisen perspektiivin säilyttämiseksi.
APA, Harvard, Vancouver, ISO, and other styles
9

Couchman, Benjamin Luke Streatfield. "On the convergence of higher-order finite element methods to weak solutions." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/115685.

Full text
Abstract:
Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2018.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 77-79).
The ability to handle discontinuities appropriately is essential when solving nonlinear hyperbolic partial differential equations (PDEs). Discrete solutions to the PDE must converge to weak solutions in order for the discontinuity propagation speed to be correct. As shown by the Lax-Wendroff theorem, one method to guarantee that convergence, if it occurs, will be to a weak solution is to use a discretely conservative scheme. However, discrete conservation is not a strict requirement for convergence to a weak solution. This suggests a hierarchy of discretizations, where discretely conservative schemes are a subset of the larger class of methods that converge to the weak solution. We show here that a range of finite element methods converge to the weak solution without using discrete conservation arguments. The effect of using quadrature rules to approximate integrals is also considered. In addition, we show that solutions using non-conservation working variables also converge to weak solutions.
by Benjamin Luke Streatfield Couchman.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
10

Chidume, Chukwudi Soares de Souza Geraldo. "Iteration methods for approximation of solutions of nonlinear equations in Banach spaces." Auburn, Ala., 2008. http://repo.lib.auburn.edu/EtdRoot/2008/SUMMER/Mathematics_and_Statistics/Dissertation/Chidume_Chukwudi_33.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Convergence des solutions"

1

Nevanlinna, Olavi. Convergence of iterations for linear equations. Basel: Birkhäuser, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Fixed-mobile wireless networks convergence: Technologies, solutions, services. Cambridge: Cambridge University Press, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kreiss, Gunilla. Convergence to steady state of solutions of Burgers' equation. Hampton, Va: ICASE, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ito, Kazufumi. Strong convergence and convergence rates of approximating solutions for algebraic Riccati equations in Hilbert spaces. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ito, Kazufumi. Strong convergence and convergence rates of approximating solutions for algebraic Riccati equations in Hilbert space. Hampton, Va: ICASE, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Carpenter, Mark H. On the conservation and convergence to weak solutions of global schemes. Hampton, VA: Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sakib, M. Shahab. Hastening convergence of the orthotropic plate solutions of bridge deck analysis. Ottawa: National Library of Canada, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Panaras, Argyris G. The spatially nonuniform convergence of the numerical solution of flows. Moffett Field, Calif: National Aeronautics and Space Administration, Ames Research Center, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kosmol, Peter. Methoden zur numerischen Behandlung nichtlinearer Gleichungen und Optimierungsaufgaben. Stuttgart: B.G. Teubner, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Wahlbin, Lars B. Superconvergence in Galerkin finite element methods. New York: Springer-Verlag, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Convergence des solutions"

1

Shaidurov, V. V. "On the convergence of approximate solutions." In Multigrid Methods for Finite Elements, 75–116. Dordrecht: Springer Netherlands, 1995. http://dx.doi.org/10.1007/978-94-015-8527-9_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Burzyk, Jozef. "Nonharmonic Solutions of the Laplace Equation." In Generalized Functions, Convergence Structures, and Their Applications, 3–11. Boston, MA: Springer US, 1988. http://dx.doi.org/10.1007/978-1-4613-1055-6_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Noelle, Sebastian, and Michael Westdickenberg. "Convergence of Approximate Solutions of Conservation Laws." In Geometric Analysis and Nonlinear Partial Differential Equations, 417–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-642-55627-2_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lewy, Hans. "On the Convergence of Solutions of Difference Equations." In Hans Lewy Selecta, 289–92. Boston, MA: Birkhäuser Boston, 2002. http://dx.doi.org/10.1007/978-1-4612-2080-0_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Reinhardt, H. J. "Discrete Convergence of Mappings and Solutions of Equations." In Applied Mathematical Sciences, 152–80. New York, NY: Springer New York, 1985. http://dx.doi.org/10.1007/978-1-4612-1080-1_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Somero, G. N. "Adapting to Water Stress: Convergence on Common Solutions." In Water and Life, 3–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-642-76682-4_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Xuan, Xiaohua. "Convergence of Finite-Element Solutions for Nonlinear PDEs." In From Topology to Computation: Proceedings of the Smalefest, 196–200. New York, NY: Springer US, 1993. http://dx.doi.org/10.1007/978-1-4612-2740-3_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Pap, Endre, and Đurđica Takači. "Estimations for the Solutions of Operator Linear Differential Equations." In Generalized Functions, Convergence Structures, and Their Applications, 267–77. Boston, MA: Springer US, 1988. http://dx.doi.org/10.1007/978-1-4613-1055-6_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Darling, Donald A. "Convergence rates for iterative solutions to optimal stopping problems." In Institute of Mathematical Statistics Lecture Notes - Monograph Series, 18–28. Hayward, CA: Institute of Mathematical Statistics, 1986. http://dx.doi.org/10.1214/lnms/1215540285.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Feng, Jin, and Thomas Kurtz. "Large deviations and nonlinear semigroup convergence using viscosity solutions." In Mathematical Surveys and Monographs, 97–107. Providence, Rhode Island: American Mathematical Society, 2006. http://dx.doi.org/10.1090/surv/131/06.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Convergence des solutions"

1

Wang, Li, Boris Diskin, Eric J. Nielsen, and Yi Liu. "Improvements in Iterative Convergence of FUN3D Solutions." In AIAA Scitech 2021 Forum. Reston, Virginia: American Institute of Aeronautics and Astronautics, 2021. http://dx.doi.org/10.2514/6.2021-0857.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Carrillo, José A., and Lucas C. F. Ferreira. "Convergence towards self-similar asymptotic behavior for the dissipative quasi-geostrophic equations." In Self-Similar Solutions of Nonlinear PDE. Warsaw: Institute of Mathematics Polish Academy of Sciences, 2006. http://dx.doi.org/10.4064/bc74-0-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kani, Jun-ichi. "Solutions for future mobile fronthaul access-network convergence." In Optical Fiber Communication Conference. Washington, D.C.: OSA, 2016. http://dx.doi.org/10.1364/ofc.2016.w1h.1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Fielder, Darrell, Christiane C. Gattaz, U. John Tanik, Murat Tanik, and Fuad Sobrinho. "Transdisciplinary convergence - a vital consideration in engineering solutions." In SoutheastCon 2016. IEEE, 2016. http://dx.doi.org/10.1109/secon.2016.7506645.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Einicke, Garry A. "Asymptotic convergence of Riccati equation and smoother solutions." In 2007 46th IEEE Conference on Decision and Control. IEEE, 2007. http://dx.doi.org/10.1109/cdc.2007.4434151.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Domel, Neal. "Time-Tensor for Rapid Convergence of CFD Solutions." In 48th AIAA Aerospace Sciences Meeting Including the New Horizons Forum and Aerospace Exposition. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2010. http://dx.doi.org/10.2514/6.2010-120.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bastarrachea-Magnani, Miguel Angel, and Jorge G. Hirsch. "Convergence in numerical solutions of the Dicke Hamiltonian." In BEAUTY IN PHYSICS: THEORY AND EXPERIMENT: In honor of Francesco Iachello on the occasion of his 70th birthday. AIP, 2012. http://dx.doi.org/10.1063/1.4759424.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Awerbuch, Baruch, Yossi Azar, Amir Epstein, Vahab Seyed Mirrokni, and Alexander Skopalik. "Fast convergence to nearly optimal solutions in potential games." In the 9th ACM conference. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1386790.1386832.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ghetie, Joseph. "Fixed Wireless and Cellular Mobile Convergence: Technologies, Solutions, Services." In 2007 9th International Conference on Telecommunications. IEEE, 2007. http://dx.doi.org/10.1109/contel.2007.381893.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bhartiya, Namrata, Namrata Jangid, and Sheetal Jannu. "Biometric Authentication Systems: Security Concerns and Solutions." In 2018 3rd International Conference for Convergence in Technology (I2CT). IEEE, 2018. http://dx.doi.org/10.1109/i2ct.2018.8529435.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Convergence des solutions"

1

Campbell, Stephen L. Distributional Convergence of BDF (Backward Differentiation Formulas) Approximations to Solutions of Descriptor Systems. Fort Belvoir, VA: Defense Technical Information Center, November 1987. http://dx.doi.org/10.21236/ada190819.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Pocher, Liam, Nathaniel Morgan, Travis Peery, and Jonathan Mace. Analysis into Asymptotic Convergence to Full Nonlinear Solutions and Exploration of the Implication of Numerical Operator Mutation of Differential Systems. Office of Scientific and Technical Information (OSTI), August 2020. http://dx.doi.org/10.2172/1648057.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Singh, Surendra, Klaus Halterman, and J. M. Elson. On Improving the Convergence of the Solution of a System of Linear Equations. Fort Belvoir, VA: Defense Technical Information Center, August 2005. http://dx.doi.org/10.21236/ada444371.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Zhang, Yin, and Richard A. Tapia. On the Convergence of Interior-Point Methods to the Center of the Solution Set in Linear Programming. Fort Belvoir, VA: Defense Technical Information Center, September 1991. http://dx.doi.org/10.21236/ada453126.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gonzaga, Clovis C., and Richard A. Tapia. On the Convergence of the Mizuno-Todd-Ye Algorithm to the Analytic Center of the Solution Set. Fort Belvoir, VA: Defense Technical Information Center, September 1994. http://dx.doi.org/10.21236/ada453879.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dantzig, G. Bracketing to speed convergence illustrated on the von Newmann algorithm for finding a feasible solution to a linear program with a convexity contraint. Office of Scientific and Technical Information (OSTI), October 1992. http://dx.doi.org/10.2172/6965882.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Dantzig, G. B. Bracketing to speed convergence illustrated on the von Newmann algorithm for finding a feasible solution to a linear program with a convexity contraint. Technical report. Office of Scientific and Technical Information (OSTI), October 1992. http://dx.doi.org/10.2172/10191256.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography