Auswahl der wissenschaftlichen Literatur zum Thema „Numerical computation“

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Numerical computation" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Numerical computation"

1

Smolensky, Paul. „Symbolic functions from neural computation“. Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 370, Nr. 1971 (28.07.2012): 3543–69. http://dx.doi.org/10.1098/rsta.2011.0334.

Der volle Inhalt der Quelle
Annotation:
Is thought computation over ideas? Turing, and many cognitive scientists since, have assumed so, and formulated computational systems in which meaningful concepts are encoded by symbols which are the objects of computation. Cognition has been carved into parts, each a function defined over such symbols. This paper reports on a research program aimed at computing these symbolic functions without computing over the symbols. Symbols are encoded as patterns of numerical activation over multiple abstract neurons, each neuron simultaneously contributing to the encoding of multiple symbols. Computation is carried out over the numerical activation values of such neurons, which individually have no conceptual meaning. This is massively parallel numerical computation operating within a continuous computational medium. The paper presents an axiomatic framework for such a computational account of cognition, including a number of formal results. Within the framework, a class of recursive symbolic functions can be computed. Formal languages defined by symbolic rewrite rules can also be specified, the subsymbolic computations producing symbolic outputs that simultaneously display central properties of both facets of human language: universal symbolic grammatical competence and statistical, imperfect performance.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Ruhe, Axel, M. G. Cox und S. Hammarling. „Reliable Numerical Computation.“ Mathematics of Computation 59, Nr. 199 (Juli 1992): 298. http://dx.doi.org/10.2307/2152999.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Sofroniou, Mark, und Giulia Spaletta. „Precise numerical computation“. Journal of Logic and Algebraic Programming 64, Nr. 1 (Juli 2005): 113–34. http://dx.doi.org/10.1016/j.jlap.2004.07.007.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Alaa Ismail, Abdalla Mostafa Elmarhomy, Abd El-Aziz Morgan und Ashraf Mostafa Hamed. „Numerical Modeling and Geometry Enhancement of a Reactive Silencer“. Journal of Advanced Research in Fluid Mechanics and Thermal Sciences 106, Nr. 1 (19.06.2023): 147–57. http://dx.doi.org/10.37934/arfmts.106.1.147157.

Der volle Inhalt der Quelle
Annotation:
Internal combustion engines and blowers frequently utilize silencers to reduce exhaust noise. In the current paper, the transmission loss of reactive silencers is predicted using the plane wave decomposition method and a three-dimensional (3-D) time-domain computational fluid dynamics (CFD) approach. A mass-flow-inlet boundary condition is first used to perform a steady flow computation, which serves as an initial condition for the two subsequent unsteady flow computations. At the model's inlet, an impulse (acoustic excitation) is placed over the constant mass flow to perform the first unstable flow computation. Once the impulse has fully propagated into the silencer, the non-reflecting boundary condition (NRBC) is then added. For the scenario without acoustic excitation at the inlet, a second unsteady flow computation is performed. During the two transient computations, the time histories of the pressure and velocity at the upstream measuring points as well as the history of the pressures at the downstream measuring point are recorded. The related acoustic quantities show variations between the two unsteady flow computational findings. As a result, the transmitted sound pressure signal is just the sound pressure downstream, while the incident sound pressure signal is obtained by utilizing plane wave decomposition upstream. The transmission loss (TL) of the silencer is then calculated after the Fast Fourier Transform (FFT) converts the two sound pressure signals from the time domain to the frequency domain. The numerical calculations and the reported data are in good agreement for the published results, in addition to geometry enhancement by increasing number of holes in the cross section for muffler.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Xiao, Shuangshuang, Kemin Li, Xiaohua Ding und Tong Liu. „Numerical Computation of Homogeneous Slope Stability“. Computational Intelligence and Neuroscience 2015 (2015): 1–10. http://dx.doi.org/10.1155/2015/802835.

Der volle Inhalt der Quelle
Annotation:
To simplify the computational process of homogeneous slope stability, improve computational accuracy, and find multiple potential slip surfaces of a complex geometric slope, this study utilized the limit equilibrium method to derive expression equations of overall and partial factors of safety. This study transformed the solution of the minimum factor of safety (FOS) to solving of a constrained nonlinear programming problem and applied an exhaustive method (EM) and particle swarm optimization algorithm (PSO) to this problem. In simple slope examples, the computational results using an EM and PSO were close to those obtained using other methods. Compared to the EM, the PSO had a small computation error and a significantly shorter computation time. As a result, the PSO could precisely calculate the slope FOS with high efficiency. The example of the multistage slope analysis indicated that this slope had two potential slip surfaces. The factors of safety were 1.1182 and 1.1560, respectively. The differences between these and the minimum FOS (1.0759) were small, but the positions of the slip surfaces were completely different than the critical slip surface (CSS).
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

GUCKENHEIMER, JOHN, KATHLEEN HOFFMAN und WARREN WECKESSER. „NUMERICAL COMPUTATION OF CANARDS“. International Journal of Bifurcation and Chaos 10, Nr. 12 (Dezember 2000): 2669–87. http://dx.doi.org/10.1142/s0218127400001742.

Der volle Inhalt der Quelle
Annotation:
Singularly perturbed systems of ordinary differential equations arise in many biological, physical and chemical systems. We present an example of a singularly perturbed system of ordinary differential equations that arises as a model of the electrical potential across the cell membrane of a neuron. We describe two periodic solutions of this example that were numerically computed using continuation of solutions of boundary value problems. One of these periodic orbits contains canards, trajectory segments that follow unstable portions of a slow manifold. We identify several mechanisms that lead to the formation of these and other canards in this example.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Das, JN. „A Least Squares Computational Method for the Scattering Amplitude“. Australian Journal of Physics 41, Nr. 1 (1988): 47. http://dx.doi.org/10.1071/ph880047.

Der volle Inhalt der Quelle
Annotation:
A new least squares computational method for the scattering amplitude is proposed. This may be applied without difficulty to atomic and other scattering computations. The approach is expected to give converged results of high accuracy and also to be free from major numerical instabilities. As an example a numerical computation is carried out following the method and some results are presented in partial support of the claim.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Sathyan, Sabin, Ugur Aydin und Anouar Belahcen. „Acoustic Noise Computation of Electrical Motors Using the Boundary Element Method“. Energies 13, Nr. 1 (03.01.2020): 245. http://dx.doi.org/10.3390/en13010245.

Der volle Inhalt der Quelle
Annotation:
This paper presents a numerical method and computational results for acoustic noise of electromagnetic origin generated by an induction motor. The computation of noise incorporates three levels of numerical calculation steps, combining both the finite element method and boundary element method. The role of magnetic forces in the production of acoustic noise is established in the paper by showing the magneto-mechanical and vibro-acoustic pathway of energy. The conversion of electrical energy into acoustic energy in an electrical motor through electromagnetic, mechanical, or acoustic platforms is illustrated through numerical computations of magnetic forces, mechanical deformation, and acoustic noise. The magnetic forces were computed through 2D electromagnetic finite element simulation, and the deformation of the stator due to these forces was calculated using 3D structural finite element simulation. Finally, boundary element-based computation was employed to calculate the sound pressure and sound power level in decibels. The use of the boundary element method instead of the finite element method in acoustic computation reduces the computational cost because, unlike finite element analysis, the boundary element approach does not require heavy meshing to model the air surrounding the motor.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Kim, Boram, Kwang Seok Yoon und Hyung-Jun Kim. „GPU-Accelerated Laplace Equation Model Development Based on CUDA Fortran“. Water 13, Nr. 23 (04.12.2021): 3435. http://dx.doi.org/10.3390/w13233435.

Der volle Inhalt der Quelle
Annotation:
In this study, a CUDA Fortran-based GPU-accelerated Laplace equation model was developed and applied to several cases. The Laplace equation is one of the equations that can physically analyze the groundwater flows, and is an equation that can provide analytical solutions. Such a numerical model requires a large amount of data to physically regenerate the flow with high accuracy, and requires computational time. These numerical models require a large amount of data to physically reproduce the flow with high accuracy and require computational time. As a way to shorten the computation time by applying CUDA technology, large-scale parallel computations were performed on the GPU, and a program was written to reduce the number of data transfers between the CPU and GPU. A GPU consists of many ALUs specialized in graphic processing, and can perform more concurrent computations than a CPU using multiple ALUs. The computation results of the GPU-accelerated model were compared with the analytical solution of the Laplace equation to verify the accuracy. The computation results of the GPU-accelerated Laplace equation model were in good agreement with the analytical solution. As the number of grids increased, the computational time of the GPU-accelerated model gradually reduced compared to the computational time of the CPU-based Laplace equation model. As a result, the computational time of the GPU-accelerated Laplace equation model was reduced by up to about 50 times.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Yue, Chun Guo, Xin Long Chang, You Hong Zhang und Shu Jun Yang. „Numerical Calculation of a Missile's Aerodynamic Characteristic“. Advanced Materials Research 186 (Januar 2011): 220–24. http://dx.doi.org/10.4028/www.scientific.net/amr.186.220.

Der volle Inhalt der Quelle
Annotation:
In virtue of Fluent of CFD software, numerical computations of aerodynamics of an air-to-air missile in different mach numbers and different attack angles were carried though. The movement trends of lift coefficient, drag coefficient and pitching moment coefficient with variety of mach numbers and attack angles were gained, meanwhile, distributing trends of pressure, temperature and weather velocity were also obtained. The results indicated that the basis and references could be offered by numerical computation results for shape design of missile and definite preponderances were showed than traditionary numerical computation methods.
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dissertationen zum Thema "Numerical computation"

1

Lesage, Pierre-Yves. „Numerical computation and software design“. Thesis, Cranfield University, 1999. http://dspace.lib.cranfield.ac.uk/handle/1826/11134.

Der volle Inhalt der Quelle
Annotation:
The development of simulation tools is becoming an important area in industry, recently fostered by the tremendous improvements in computer hardware. Many physical problems can be simulated by being modelled by mathematical equations which can then be solved numerically. This thesis is concerned with the development of a Finite Difference solver for time dependent partial differential equations. The development involves a number of challenging requirements that the solver must meet: to have the capacity of solving conservation and non-conservation laws (using several numerical techniques), to be robust, efficient and to have a modular and extendible design. Firstly, we focus on the architecture of the program and how an original design approach was used in order to carry out its development. A combination of Object- Oriented Design and Structured Design was adopted.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Lesage, P.-Y. „Numerical computation and software design“. Thesis, Cranfield University, 1999. http://dspace.lib.cranfield.ac.uk/handle/1826/11134.

Der volle Inhalt der Quelle
Annotation:
The development of simulation tools is becoming an important area in industry, recently fostered by the tremendous improvements in computer hardware. Many physical problems can be simulated by being modelled by mathematical equations which can then be solved numerically. This thesis is concerned with the development of a Finite Difference solver for time dependent partial differential equations. The development involves a number of challenging requirements that the solver must meet: to have the capacity of solving conservation and non-conservation laws (using several numerical techniques), to be robust, efficient and to have a modular and extendible design. Firstly, we focus on the architecture of the program and how an original design approach was used in order to carry out its development. A combination of Object- Oriented Design and Structured Design was adopted.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Nassiri, Masoud. „Numerical computation of shallow recirculating flow“. Thesis, McGill University, 1994. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=68046.

Der volle Inhalt der Quelle
Annotation:
The recirculating flows behind a sudden expansion in an open channel are computed using three different turbulence models: (i) a standard single-length-scale $ kappa$-$ epsilon$ model, (ii) a two-length-scale $ kappa$-$ epsilon$, and (iii) a constant-eddy-viscosity model. The performance of these models is evaluated by comparing the numerical results with the experimental data obtained from the previous investigation.
The flow simulation is characterized by two basic dimensionless parameters: a turbulent Reynolds number, $Re sb{T},$ which defines the level of eddy viscosity, and a bed-friction number, S, which represents the effect of bed friction. The study shows that in the limit of shallow water depth, that is S $>$ 0.10, the mean flow is quite successfully predicted by all employed models. However, in the limit of deep water depth, S $<$ 0.10, both $ kappa- epsilon$ models under-predict the length of the recirculating region due to the high level of computed eddy viscosity. On the other hand, the study indicates that the constant viscosity model gives quite acceptable results for most engineering applications.
Advantageously using the constant viscosity model's simple concept, an attempt is made to define a criterion for numerical stability of the computational procedure. The stability of the algorithm is assessed by varying the flow Reynolds number, the bed-friction number as well as the mesh size. The Courant number, a dimensionless parameter, is then introduced and correlated with the $Re sb{T}$ and S, thus providing the means to determine the stability of the numerical calculations.
As most of the recirculating flows observed in natural waterways are dominated by the bed-friction effect, accurate simulation of the mean flow field is possible even with an incorrect model for the lateral exchange process.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Zerroukat, Mohamed. „Numerical computation of moving boundary phenomena“. Thesis, University of Glasgow, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.285256.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Romero, i. Sànchez David. „Numerical computation of invariant objects with wavelets“. Doctoral thesis, Universitat Autònoma de Barcelona, 2015. http://hdl.handle.net/10803/395169.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Bohigas, Nadal Oriol. „Numerical computation and avoidance of manipulator singularities“. Doctoral thesis, Universitat Politècnica de Catalunya, 2013. http://hdl.handle.net/10803/117535.

Der volle Inhalt der Quelle
Annotation:
This thesis develops general solutions to two open problems of robot kinematics: the exhaustive computation of the singularity set of a manipulator, and the synthesis of singularity-free paths between given configurations. Obtaining proper solutions to these problems is crucial, because singularities generally pose problems to the normal operation of a robot and, thus, they should be taken into account before the actual construction of a prototype. The ability to compute the whole singularity set also provides rich information on the global motion capabilities of a manipulator. The projections onto the task and joint spaces delimit the working regions in such spaces, may inform on the various assembly modes of the manipulator, and highlight areas where control or dexterity losses can arise, among other anomalous behaviour. These projections also supply a fair view of the feasible movements of the system, but do not reveal all possible singularity-free motions. Automatic motion planners allowing to circumvent problematic singularities should thus be devised to assist the design and programming stages of a manipulator. The key role played by singular configurations has been thoroughly known for several years, but existing methods for singularity computation or avoidance still concentrate on specific classes of manipulators. The absence of methods able to tackle these problems on a sufficiently large class of manipulators is problematic because it hinders the analysis of more complex manipulators or the development of new robot topologies. A main reason for this absence has been the lack of computational tools suitable to the underlying mathematics that such problems conceal. However, recent advances in the field of numerical methods for polynomial system solving now permit to confront these issues with a very general intention in mind. The purpose of this thesis is to take advantage of this progress and to propose general robust methods for the computation and avoidance of singularities on non-redundant manipulators of arbitrary architecture. Overall, the work seeks to contribute to the general understanding on how the motions of complex multibody systems can be predicted, planned, or controlled in an efficient and reliable way.
Aquesta tesi desenvolupa solucions generals per dos problemes oberts de la cinemàtica de robots: el càlcul exhaustiu del conjunt singular d'un manipulador, i la síntesi de camins lliures de singularitats entre configuracions donades. Obtenir solucions adequades per aquests problemes és crucial, ja que les singularitats plantegen problemes al funcionament normal del robot i, per tant, haurien de ser completament identificades abans de la construcció d'un prototipus. La habilitat de computar tot el conjunt singular també proporciona informació rica sobre les capacitats globals de moviment d'un manipulador. Les projeccions cap a l'espai de tasques o d'articulacions delimiten les regions de treball en aquests espais, poden informar sobre les diferents maneres de muntar el manipulador, i remarquen les àrees on poden sorgir pèrdues de control o destresa, entre d'altres comportaments anòmals. Aquestes projeccions també proporcionen una imatge fidel dels moviments factibles del sistema, però no revelen tots els possibles moviments lliures de singularitats. Planificadors de moviment automàtics que permetin evitar les singularitats problemàtiques haurien de ser ideats per tal d'assistir les etapes de disseny i programació d'un manipulador. El paper clau que juguen les configuracions singulars ha estat àmpliament conegut durant anys, però els mètodes existents pel càlcul o evitació de singularitats encara es concentren en classes específiques de manipuladors. L'absència de mètodes capaços de tractar aquests problemes en una classe suficientment gran de manipuladors és problemàtica, ja que dificulta l'anàlisi de manipuladors més complexes o el desenvolupament de noves topologies de robots. Una raó principal d'aquesta absència ha estat la manca d'eines computacionals adequades a les matemàtiques subjacents que aquests problemes amaguen. No obstant, avenços recents en el camp de mètodes numèrics per la solució de sistemes polinòmics permeten ara enfrontar-se a aquests temes amb una intenció molt general en ment. El propòsit d'aquesta tesi és aprofitar aquest progrés i proposar mètodes robustos i generals pel càlcul i evitació de singularitats per manipuladors no redundants d'arquitectura arbitrària. En global, el treball busca contribuir a la comprensió general sobre com els moviments de sistemes multicos complexos es poden predir, planificar o controlar d'una manera eficient i segura
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Lin, Hong-Chia. „Topics in Numerical Computation of Compressible Flow“. Thesis, Cranfield University, 1990. http://dspace.lib.cranfield.ac.uk/handle/1826/4555.

Der volle Inhalt der Quelle
Annotation:
This thesis aims to assist the development of a multiblock implicit Navier-Stokes code for hypersonic flow applications. There are mainly three topics, which concern the understanding of basic Riemann solvers, the implementing of implicit zonal method, and grid adaption for viscous flow. Three problems of Riemann solvers are investigated. The post-shock oscillation problem of slowly moving shocks is examined, especially for Roe's Riemann solver, and possible cures are suggested for both first and second order schemes. The carbuncle phenomenon associated with blunt body calculation is cured by a formula based on pressure gradient, which will not degrade the solutions for viscous calculations too much. The grid-dependent characteristic of current upwind schemes is also demonstrated. Several issues associated with implicit zonal methods are discussed. The effects of having different mesh sizes in different zones when shock present are examined with first order explicit scheme and such effects are shown to be unwanted therefore big mesh size change should be avoided. Several implicit schemes are tested for hypersonic flow. The conservative DDADI scheme is found to be the most robust one. A simple and robust implicit zonal method is demonstrated. A proper treatment of the diagonal Jacobian and choosing the updating method are found to be crucial. The final topic concerns the calculation and grid adaption of viscous flow. We study the linear advection-diffusion equation thoroughly. The results are unfortunately not applicable to Navier-Stokes equations directly. Nevertheless a suggestion on the mesh size control for viscous flow is made and demonstrated. An attempt to construct a cell-vertex TVD scheme is described in the appendix.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Betcke, Timo. „Numerical computation of eigenfunctions of planar regions“. Thesis, University of Oxford, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.426381.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Prosser, Robert. „Numerical methods for the computation of combustion“. Thesis, University of Cambridge, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.340975.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Dougherty, Edward T. „Computation and Numerics in Neurostimulation“. Diss., Virginia Tech, 2015. http://hdl.handle.net/10919/73350.

Der volle Inhalt der Quelle
Annotation:
Neurostimulation continues to demonstrate tremendous success as an intervention for neurodegenerative diseases, including Parkinson's disease, in addition to a range of other neurological and psychiatric disorders. In an effort to enhance the medical efficacy and comprehension of this form of brain therapy, modeling and computational simulation are regarded as valuable tools that enable in silico experiments for a range of neurostimulation research endeavours. To fully realize the capacities of neurostimulation simulations, several areas within computation and numerics need to be considered and addressed. Specifically, simulations of neurostimulation that incorporate (i) computational efficiency, (ii) application versatility, and (iii) characterizations of cellular-level electrophysiology would be highly propitious in supporting advancements in this medical treatment. The focus of this dissertation is on these specific areas. First, preconditioners and iterative methods for solving the linear system of equations resulting from finite element discretizations of partial differential equation based transcranial electrical stimulation models are compared. Second, a software framework designed to efficiently support the range of clinical, biomedical, and numerical simulations utilized within the neurostimulation community is presented. Third, a multiscale model that couples transcranial direct current stimulation administrations to neuronal transmembrane voltage depolarization is presented. Fourth, numerical solvers for solving ordinary differential equation based ligand-gated neurotransmitter receptor models are analyzed. A fundamental objective of this research has been to accurately emulate the unique medical characteristics of neurostimulation treatments, with minimal simplification, thereby providing optimal utility to the scientific research and medical communities. To accomplish this, numerical simulations incorporate high-resolution, MRI-derived three-dimensional head models, real-world electrode configurations and stimulation parameters, physiologically-based inhomogeneous and anisotropic tissue conductivities, and mathematical models accepted by the brain modeling community. It is my hope that this work facilitates advancements in neurostimulation simulation capabilities, and ultimately helps improve the understanding and treatment of brain disease.
Ph. D.
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bücher zum Thema "Numerical computation"

1

Ueberhuber, Christoph W. Numerical Computation 2. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-59109-9.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Ueberhuber, Christoph W. Numerical Computation 1. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-59118-1.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

G, Cox M., Hammarling S. J und Wilkinson J. H, Hrsg. Reliable numerical computation. Oxford: Clarendon Press, 1990.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Glassey, Robert. Numerical computation using C. Boston: Academic Press, 1993.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Driscoll, Tobin A., und Richard J. Braun. Fundamentals of Numerical Computation. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2017. http://dx.doi.org/10.1137/1.9781611975086.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Yang, Tianruo, Hrsg. Parallel Numerical Computation with Applications. Boston, MA: Springer US, 1999. http://dx.doi.org/10.1007/978-1-4615-5205-5.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Winkler, Franz, und Ulrich Langer, Hrsg. Symbolic and Numerical Scientific Computation. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-45084-x.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Bertsekas, Dimitri P. Parallel and distributed computation: Numerical methods. Belmont, Mass: Athena Scientific, 1997.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

N, Tsitsiklis John, Hrsg. Parallel and distributed computation: Numerical methods. Englewood Cliffs, N.J: Prentice Hall, 1989.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Numerical computation in science and engineering. New York: Oxford University Press, 1998.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Numerical computation"

1

Touzani, Rachid, und Jacques Rappaz. „Numerical Methods“. In Scientific Computation, 153–94. Dordrecht: Springer Netherlands, 2013. http://dx.doi.org/10.1007/978-94-007-0202-8_7.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Harris, John W., und Horst Stocker. „Numerical Computation (arithmetics and numerics)“. In Handbook of Mathematics and Computational Science, 1–36. New York, NY: Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4612-5317-4_1.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Hout, Sam A. „Numerical Methods—Computation“. In Advanced Manufacturing Operations Technologies, 97–106. Boca Raton: CRC Press, 2023. http://dx.doi.org/10.1201/9781003384199-16.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Ueberhuber, Christoph W. „Numerical Data and Numerical Operations“. In Numerical Computation 1, 106–71. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-59118-1_4.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Ueberhuber, Christoph W. „Numerical Integration“. In Numerical Computation 2, 65–169. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-59109-9_3.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Ueberhuber, Christoph W. „Numerical Algorithms“. In Numerical Computation 1, 172–218. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-59118-1_5.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Ueberhuber, Christoph W. „Numerical Programs“. In Numerical Computation 1, 219–71. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-59118-1_6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Cohen, Gary C. „Numerical Dispersion and Anisotropy“. In Scientific Computation, 101–21. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-662-04823-8_7.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Ehold, Harald J., Wilfried N. Gansterer, Dieter F. Kvasnicka und Christoph W. Ueberhuber. „HPF and Numerical Libraries“. In Parallel Computation, 140–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-49164-3_14.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Wang, Liang, und Jianxin Zhao. „Computation Graph“. In Architecture of Advanced Numerical Analysis Systems, 149–89. Berkeley, CA: Apress, 2022. http://dx.doi.org/10.1007/978-1-4842-8853-5_6.

Der volle Inhalt der Quelle
Annotation:
AbstractA computation graph is a basic theoretical tool that underlines modern deep learning libraries. It is also an important component in Owl. This chapter first gives a bird’s-eye view on the computation graph in Owl and its importance in computing. We then demonstrate how to use it in Owl with some examples. Then we will continue to cover the design and implementation details of the computation graph module and how it is fitted into Owl’s functor stack.
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Numerical computation"

1

Zhi, Lihong. „Numerical optimization in hybrid symbolic-numeric computation“. In ISSAC07: International Symposium on Symbolic and Algebraic Computation. New York, NY, USA: ACM, 2007. http://dx.doi.org/10.1145/1277500.1277507.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Žunić, Dragiša, und Pierre Lescanne. „Classical computation with negation“. In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2012: International Conference of Numerical Analysis and Applied Mathematics. AIP, 2012. http://dx.doi.org/10.1063/1.4756169.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Nakakura, Kansaku, und Sunao Murashige. „Numerical Computation of the Mapping Degree using Computational Homology“. In 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN 2006). IEEE, 2006. http://dx.doi.org/10.1109/scan.2006.32.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Darulova, Eva, und Viktor Kuncak. „Trustworthy numerical computation in Scala“. In the 2011 ACM international conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/2048066.2048094.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Bohigas, Oriol, Dimiter Zlatanov, Lluis Ros, Montserrat Manubens und Josep M. Porta. „Numerical computation of manipulator singularities“. In 2012 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2012. http://dx.doi.org/10.1109/icra.2012.6225083.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Janovská, Drahoslava, Vladimír Janovský und Kunio Tanabe. „Computation of Pseudospectra via a Continuation“. In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS: International Conference on Numerical Analysis and Applied Mathematics 2008. American Institute of Physics, 2008. http://dx.doi.org/10.1063/1.2990916.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Lescanne, Pierre, Dragiša Žunić, Theodore E. Simos, George Psihoyios, Ch Tsitouras und Zacharias Anastassi. „Classical Proofs’ Essence and Diagrammatic Computation“. In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2011: International Conference on Numerical Analysis and Applied Mathematics. AIP, 2011. http://dx.doi.org/10.1063/1.3636852.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Singer, Saša, Theodore E. Simos, George Psihoyios und Ch Tsitouras. „Accurate Computation of Gaussian Quadrature for Tension Powers“. In Numerical Analysis and Applied Mathematics. AIP, 2007. http://dx.doi.org/10.1063/1.2790194.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Aceto, Lidia, Alessandra Sestini, Theodore E. Simos, George Psihoyios und Ch Tsitouras. „On the Numerical Computation of the LMM's Coefficients“. In Numerical Analysis and Applied Mathematics. AIP, 2007. http://dx.doi.org/10.1063/1.2790217.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Khoromskij, B. N., und A. Litvinenko. „Data Sparse Computation of the Karhunen‐Loève Expansion“. In NUMERICAL ANALYSIS AND APPLIED MATHEMATICS: International Conference on Numerical Analysis and Applied Mathematics 2008. American Institute of Physics, 2008. http://dx.doi.org/10.1063/1.2990920.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Numerical computation"

1

Golub, Gene H. Computational Equipment for the Development of Numerical Algorithms Computation. Fort Belvoir, VA: Defense Technical Information Center, August 1990. http://dx.doi.org/10.21236/ada226702.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Menikoff, Ralph. Numerical computation of Pop plot. Office of Scientific and Technical Information (OSTI), März 2015. http://dx.doi.org/10.2172/1209280.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

MacCormack, R. W. Numerical Computation in MagnetoFluid Dynamics. Fort Belvoir, VA: Defense Technical Information Center, Juni 2004. http://dx.doi.org/10.21236/ada427194.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Schnabel, R. Concurrent Algorithms for Numerical Computation on Hypercube Computer. Fort Belvoir, VA: Defense Technical Information Center, Februar 1988. http://dx.doi.org/10.21236/ada195502.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Skeel, R. D. Safety in numbers: The boundless errors of numerical computation. Office of Scientific and Technical Information (OSTI), Juni 1989. http://dx.doi.org/10.2172/6245350.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Hou, Thomas Y., und Philippe G. LeFloch. Numerical Methods for the Computation of Propagating Phase Boundaries. Fort Belvoir, VA: Defense Technical Information Center, Januar 1997. http://dx.doi.org/10.21236/ada340390.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

D'Ippolito, D. A., und J. R. Myra. Numerical Computation of Wave-Plasma Interactions in Multi-Dimensional Systems. Office of Scientific and Technical Information (OSTI), Februar 2005. http://dx.doi.org/10.2172/837006.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Chase, Ronald, H. B. Wallace und Thomas Blalock. Numerical Computation of the Radar Cross Section of the ZSU-23-4. Fort Belvoir, VA: Defense Technical Information Center, April 1999. http://dx.doi.org/10.21236/ada363007.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

French, Donald A. Numerical Analysis and Computation of Nonlinear Partial Differential Equations from Applied Mathematics. Fort Belvoir, VA: Defense Technical Information Center, November 1993. http://dx.doi.org/10.21236/ada275582.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

French, Donald A. Numerical Analysis and Computation of Nonlinear Partial Differential Equations from Applied Mathematics. Fort Belvoir, VA: Defense Technical Information Center, Oktober 1990. http://dx.doi.org/10.21236/ada231188.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie