Log in

Relevant bibliographies by topics / Complexity and performance of numerical algorithms {Numerical analysis

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Complexity and performance of numerical algorithms {Numerical analysis'

Author: Grafiati

Published: 4 June 2021

Last updated: 11 February 2022

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 'Complexity and performance of numerical algorithms {Numerical analysis.'

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 "Complexity and performance of numerical algorithms {Numerical analysis"

1

Olver, Sheehan, Richard Mikaël Slevinsky, and Alex Townsend. "Fast algorithms using orthogonal polynomials." Acta Numerica 29 (May 2020): 573–699. http://dx.doi.org/10.1017/s0962492920000045.

Full text

Abstract:

We review recent advances in algorithms for quadrature, transforms, differential equations and singular integral equations using orthogonal polynomials. Quadrature based on asymptotics has facilitated optimal complexity quadrature rules, allowing for efficient computation of quadrature rules with millions of nodes. Transforms based on rank structures in change-of-basis operators allow for quasi-optimal complexity, including in multivariate settings such as on triangles and for spherical harmonics. Ordinary and partial differential equations can be solved via sparse linear algebra when set up u

APA, Harvard, Vancouver, ISO, and other styles

2

Čiegis, R., O. Iliev, and Z. Lakdawala. "On Parallel Numerical Algorithms for Simulating Industrial Filtration Problems." Computational Methods in Applied Mathematics 7, no. 2 (2007): 118–34. http://dx.doi.org/10.2478/cmam-2007-0007.

Full text

Abstract:

AbstractThe performance of oil filters used in the automotive industry can be significantly improved, especially when computer simulation is an essential component of the design process. In this paper, we consider parallel numerical algorithms for solving mathematical models describing the process of filtration, filtering solid particles out of liquid oil. The Navier — Stokes — Brinkmann system of equations is used to describe the laminar flow of incompressible isothermal oil. The space discretization in the complicated filter geometry is based on the finite-volume method. Special care is take

APA, Harvard, Vancouver, ISO, and other styles

3

Liu, Feifei, Chengyu Liu, Xinge Jiang, et al. "Performance Analysis of Ten Common QRS Detectors on Different ECG Application Cases." Journal of Healthcare Engineering 2018 (2018): 1–8. http://dx.doi.org/10.1155/2018/9050812.

Full text

Abstract:

A systematical evaluation work was performed on ten widely used and high-efficient QRS detection algorithms in this study, aiming at verifying their performances and usefulness in different application situations. Four experiments were carried on six internationally recognized databases. Firstly, in the test of high-quality ECG database versus low-quality ECG database, for high signal quality database, all ten QRS detection algorithms had very high detection accuracy (F1 >99%), whereas the F1 results decrease significantly for the poor signal-quality ECG signals (all <80%). Secondly, in

APA, Harvard, Vancouver, ISO, and other styles

4

Rusu, Alexandru-George, Silviu Ciochina, Constantin Paleologu, and Jacob Benesty. "An Optimized Differential Step-Size LMS Algorithm." Algorithms 12, no. 8 (2019): 147. http://dx.doi.org/10.3390/a12080147.

Full text

Abstract:

Adaptive algorithms with differential step-sizes (related to the filter coefficients) are well known in the literature, most frequently as “proportionate” algorithms. Usually, they are derived on a heuristic basis. In this paper, we introduce an algorithm resulting from an optimization criterion. Thereby, we obtain a benchmark algorithm and also another version with lower computational complexity, which is rigorously valid for less correlated input signals. Simulation results confirm the theory and outline the performance of the algorithms. Unfortunately, the good performance is obtained by an

APA, Harvard, Vancouver, ISO, and other styles

5

Ling, Sai Ho, and Hak Keung Lam. "Evolutionary Algorithms in Health Technologies." Algorithms 12, no. 10 (2019): 202. http://dx.doi.org/10.3390/a12100202.

Full text

Abstract:

Health technology research brings together complementary interdisciplinary research skills in the development of innovative health technology applications. Recent research indicates that artificial intelligence can help achieve outstanding performance for particular types of health technology applications. An evolutionary algorithm is one of the subfields of artificial intelligence, and is an effective algorithm for global optimization inspired by biological evolution. With the rapidly growing complexity of design issues, methodologies and a higher demand for quality health technology applicat

APA, Harvard, Vancouver, ISO, and other styles

6

Arefin, Md Rajib, and M. Asadujjaman. "Minimizing Average of Loss Functions Using Gradient Descent and Stochastic Gradient Descent." Dhaka University Journal of Science 64, no. 2 (2016): 141–45. http://dx.doi.org/10.3329/dujs.v64i2.54490.

Full text

Abstract:

This paper deals with minimizing average of loss functions using Gradient Descent (GD) and Stochastic Gradient Descent (SGD). We present these two algorithms for minimizing average of a large number of smooth convex functions. We provide some discussions on their complexity analysis, also illustrate the algorithms geometrically. At the end, we compare their performance through numerical experiments. Dhaka Univ. J. Sci. 64(2): 141-145, 2016 (July)

APA, Harvard, Vancouver, ISO, and other styles

7

Albera, L., A. Kachenoura, P. Comon, et al. "ICA-Based EEG denoising: a comparative analysis of fifteen methods." Bulletin of the Polish Academy of Sciences: Technical Sciences 60, no. 3 (2012): 407–18. http://dx.doi.org/10.2478/v10175-012-0052-3.

Full text

Abstract:

Abstract Independent Component Analysis (ICA) plays an important role in biomedical engineering. Indeed, the complexity of processes involved in biomedicine and the lack of reference signals make this blind approach a powerful tool to extract sources of interest. However, in practice, only few ICA algorithms such as SOBI, (extended) InfoMax and FastICA are used nowadays to process biomedical signals. In this paper we raise the question whether other ICA methods could be better suited in terms of performance and computational complexity. We focus on ElectroEncephaloGraphy (EEG) data denoising,

APA, Harvard, Vancouver, ISO, and other styles

8

Lin, Heyun, Chaowei Yuan, Jianhe Du, and Zhongwei Hu. "Estimation of DOA for Noncircular Signals via Vandermonde Constrained Parallel Factor Analysis." International Journal of Antennas and Propagation 2018 (2018): 1–9. http://dx.doi.org/10.1155/2018/4612583.

Full text

Abstract:

We provide a complete study on the direction-of-arrival (DOA) estimation of noncircular (NC) signals for uniform linear array (ULA) via Vandermonde constrained parallel factor (PARAFAC) analysis. By exploiting the noncircular property of the signals, we first construct an extended matrix which contains two times sampling number of the received signal. Then, taking the Vandermonde structure of the array manifold matrix into account, the extended matrix can be turned into a tensor model which admits the Vandermonde constrained PARAFAC decomposition. Based on this tensor model, an efficient linea

APA, Harvard, Vancouver, ISO, and other styles

9

Panferov, V. I., S. V. Panferov, А. М. Hayutin, and N. A. Trenin. "On One Solution of the Numerical Problem Differentiation in Calculation Vertical Speed of Aircraft." Bulletin of the South Ural State University. Ser. Computer Technologies, Automatic Control & Radioelectronics 21, no. 2 (2021): 47–57. http://dx.doi.org/10.14529/ctcr210205.

Full text

Abstract:

To ensure safety and improve the efficiency of flight missions, reliable information about the altitude and speed parameters of the aircraft (AC) is required. Therefore, improving the algorithm for calculating the vertical speed used as part of the algorithmic support for air signal systems (ASS) is a very urgent task. Purpose of the study. The problem of calculating the vertical speed of an aircraft in the ASS is considered. Materials and methods. The analysis of literature data on the use of numerical differentiation procedures to solve this problem is carried out, it is noted that the metho

APA, Harvard, Vancouver, ISO, and other styles

10

Zhao, Yulin, Donghui Wang, and Leiou Wang. "Convolution Accelerator Designs Using Fast Algorithms." Algorithms 12, no. 5 (2019): 112. http://dx.doi.org/10.3390/a12050112.

Full text

Abstract:

Convolutional neural networks (CNNs) have achieved great success in image processing. However, the heavy computational burden it imposes makes it difficult for use in embedded applications that have limited power consumption and performance. Although there are many fast convolution algorithms that can reduce the computational complexity, they increase the difficulty of practical implementation. To overcome these difficulties, this paper proposes several convolution accelerator designs using fast algorithms. The designs are based on the field programmable gate array (FPGA) and display a better

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Complexity and performance of numerical algorithms {Numerical analysis"

1

Wei, Ke. "Efficient algorithms for compressed sensing and matrix completion." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:0e2e72fb-dd0c-457b-a0a5-f91c5212f5f5.

Full text

Abstract:

Compressed sensing and matrix completion are two new data acquisition techniques whose efficiency is achieved by exploring low dimensional structures in high dimensional data. Despite the combinatorial nature of compressed sensing and matrix completion, there has been significant development of computationally efficient algorithms which can produce accurate desired solutions to these problems. In this thesis, we are concerned with the development of low per iteration computational complexity algorithms for compressed sensing and matrix completion. First, we derive a locally optimal stepsize se

APA, Harvard, Vancouver, ISO, and other styles

2

Silva, Nunes Ana Luisa. "Spectral approximation with matrices issued from discretized operators." Phd thesis, Université Jean Monnet - Saint-Etienne, 2012. http://tel.archives-ouvertes.fr/tel-00952977.

Full text

Abstract:

In this thesis, we consider the numerical solution of a large eigenvalue problem in which the integral operator comes from a radiative transfer problem. It is considered the use of hierarchical matrices, an efficient data-sparse representation of matrices, especially useful for large dimensional problems. It consists on low-rank subblocks leading to low memory requirements as well as cheap computational costs. We discuss the use of the hierarchical matrix technique in the numerical solution of a large scale eigenvalue problem arising from a finite rank discretization of an integral operator. T

APA, Harvard, Vancouver, ISO, and other styles

3

Guney, Murat Efe. "High-performance direct solution of finite element problems on multi-core processors." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/34662.

Full text

Abstract:

A direct solution procedure is proposed and developed which exploits the parallelism that exists in current symmetric multiprocessing (SMP) multi-core processors. Several algorithms are proposed and developed to improve the performance of the direct solution of FE problems. A high-performance sparse direct solver is developed which allows experimentation with the newly developed and existing algorithms. The performance of the algorithms is investigated using a large set of FE problems. Furthermore, operation count estimations are developed to further assess various algorithms. An out-of-core v

APA, Harvard, Vancouver, ISO, and other styles

4

Fladrich, Uwe. "Nodale Spektralelemente und unstrukturierte Gitter - Methodische Aspekte und effiziente Algorithmen." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-97119.

Full text

Abstract:

Die Dissertation behandelt methodische und algorithmische Aspekte der Spektralelementemethode zur räumlichen Diskretisierung partieller Differentialgleichungen. Die Weiterentwicklung einer symmetriebasierten Faktorisierung ermöglicht effiziente Operatoren für Tetraederelemente. Auf Grundlage einer umfassenden Leistungsanalyse werden Engpässe in der Implementierung der Operatoren identifiziert und durch algorithmische Modifikationen der Methode eliminiert.

APA, Harvard, Vancouver, ISO, and other styles

5

Srinivas, L. "FIR System Identification Using Higher Order Cumulants -A Generalized Approach." Thesis, Indian Institute of Science, 1994. http://hdl.handle.net/2005/637.

Full text

Abstract:

The thesis presents algorithms based on a linear algebraic solution for the identification of the parameters of the FIR system using only higher order statistics when only the output of the system corrupted by additive Gaussian noise is observed. All the traditional parametric methods of estimating the parameters of the system have been based on the 2nd order statistics of the output of the system. These methods suffer from the deficiency that they do not preserve the phase response of the system and hence cannot identify non-minimum phase systems. To circumvent this problem, highe

APA, Harvard, Vancouver, ISO, and other styles

6

Malmgren, Henrik. "Revision of an artificial neural network enabling industrial sorting." Thesis, Uppsala universitet, Institutionen för teknikvetenskaper, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-392690.

Full text

Abstract:

Convolutional artificial neural networks can be applied for image-based object classification to inform automated actions, such as handling of objects on a production line. The present thesis describes theoretical background for creating a classifier and explores the effects of introducing a set of relatively recent techniques to an existing ensemble of classifiers in use for an industrial sorting system.The findings indicate that it's important to use spatial variety dropout regularization for high resolution image inputs, and use an optimizer configuration with good convergence properties. T

APA, Harvard, Vancouver, ISO, and other styles

7

(10223831), Yuankun Fu. "Accelerated In-situ Workflow of Memory-aware Lattice Boltzmann Simulation and Analysis." Thesis, 2021.

Find full text

Abstract:

<div>As high performance computing systems are advancing from petascale to exascale, scientific workflows to integrate simulation and visualization/analysis are a key factor to influence scientific campaigns. As one of the campaigns to study fluid behaviors, computational fluid dynamics (CFD) simulations have progressed rapidly in the past several decades, and revolutionized our lives in many fields. Lattice Boltzmann method (LBM) is an evolving CFD approach to significantly reducing the complexity of the conventional CFD methods, and can simulate complex fluid flow phenomena with cheaper comp

APA, Harvard, Vancouver, ISO, and other styles

8

Klimanis, Nils. "Generic Programming and Algebraic Multigrid for Stabilized Finite Element Methods." Doctoral thesis, 2006. http://hdl.handle.net/11858/00-1735-0000-0006-B38C-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Woolway, Matthew. "Computational approaches in compressed sensing." Thesis, 2014. http://hdl.handle.net/10539/15334.

Full text

Abstract:

A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg, in fulfilment of the requirements for the degree of Master of Science. Johannesburg, 2014.<br>This thesis aims to provide a summary on computational approaches to solving the Compressed Sensing problem. The theoretical problem of solving systems of linear equations has long been investigated in academic literature. A relatively new field, Compressed Sensing is an application of such a problem. Specifically, with the ability to change the way in which we obtain and process signals. Under the a

APA, Harvard, Vancouver, ISO, and other styles

10

(9179300), Evgenia-Maria Kontopoulou. "RANDOMIZED NUMERICAL LINEAR ALGEBRA APPROACHES FOR APPROXIMATING MATRIX FUNCTIONS." Thesis, 2020.

Find full text

Abstract:

<p>This work explores how randomization can be exploited to deliver sophisticated</p><p>algorithms with provable bounds for: (i) The approximation of matrix functions, such</p><p>as the log-determinant and the Von-Neumann entropy; and (ii) The low-rank approximation</p><p>of matrices. Our algorithms are inspired by recent advances in Randomized</p><p>Numerical Linear Algebra (RandNLA), an interdisciplinary research area that exploits</p><p>randomization as a computational resource to develop improved algorithms for</p><p>large-scale linear algebra problems. The main goal of this work is to enc

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Complexity and performance of numerical algorithms {Numerical analysis"

1

1957-, Gurvits Leonid, and Banff International Research Station for Mathematics Innovation & Discovery, eds. Randomization, relaxation, and complexity in polynomial equation solving: Banff International Research Station Workshop on Randomization, Relaxation, and Complexity, February 28--March 5, 2010, Banff, Ontario [i.e. Alberta], Canada. American Mathematical Society, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Algorithms: Their complexity and efficiency. 2nd ed. Wiley, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

David, Kramer, Weiss Jan-Philipp, and SpringerLink (Online service), eds. Facing the Multicore - Challenge II: Aspects of New Paradigms and Technologies in Parallel Computing. Springer Berlin Heidelberg, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Wang, Tse-kʻo. Algebraic systems of equations and computational complexity theory. Science Press, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Workshop on "Large-scale Scientific Computations" (2nd 1999 Sozopol, Bulgaria). Large-scale scientific computations of engineering and environmental problems II: Proceedings of the second workshop on "Large-scale scientific computations", Sozopol, Bulgaria, June 2-6, 1999. Vieweg, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Workshop, on "Large-scale Scientific Computations" (1st 1997 Varna Bulgaria). Large-scale scientific computations of engineering and environmental problems: Proceedings of the First Workshop on "Large-scale Scientific Computations", Varna, Bulgaria, June 7-11, 1997. Vieweg, 1998.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Jérôme, Leroux, Potapov Igor, and SpringerLink (Online service), eds. Reachability Problems: 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings. Springer Berlin Heidelberg, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Daydé, Michel. High Performance Computing for Computational Science - VECPAR 2012: 10th International Conference, Kope, Japan, July 17-20, 2012, Revised Selected Papers. Springer Berlin Heidelberg, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Manninen, Pekka. Applied Parallel and Scientific Computing: 11th International Conference, PARA 2012, Helsinki, Finland, June 10-13, 2012, Revised Selected Papers. Springer Berlin Heidelberg, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

1974-, Zomorodian Afra J., ed. Advances in applied and computational topology: American Mathematical Society Short Course on Computational Topology, January 4-5, 2011, New Orleans, Louisiana. American Mathematical Society, 2012.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Complexity and performance of numerical algorithms {Numerical analysis"

1

Siriteanu, Constantin, and Steven D. Blostein. "Eigencombining." In Handbook on Advancements in Smart Antenna Technologies for Wireless Networks. IGI Global, 2009. http://dx.doi.org/10.4018/978-1-59904-988-5.ch001.

Full text

Abstract:

This chapter unifies the principles and analyses of conventional signal processing algorithms for receive-side smart antennas, and compares their performance and numerical complexity. The chapter starts with a brief look at the traditional single-antenna optimum symbol-detector, continues with analyses of conventional smart antenna algorithms, i.e., statistical beamforming (BF) and maximal-ratio combining (MRC), and culminates with an assessment of their recently proposed superset known as eigencombining or eigenbeamforming. BF or MRC performance fluctuates with changing propagation conditions, although their numerical complexity remains constant. Maximal-ratio eigencombining (MREC) has been devised to achieve best (i.e., near-MRC) performance for complexity that matches the actual channel conditions. The authors derive MREC outage probability and average error probability expressions applicable for any correlation. Particular cases apply to BF and MRC. These tools and numerical complexity assessments help demonstrate the advantages of MREC versus BF or MRC in realistic scenarios.

APA, Harvard, Vancouver, ISO, and other styles

2

Rodríguez-Dagnino, Ramón M., and Hideaki Takagi. "Handover Analysis and Dynamic Mobility Management for Wireless Cellular Networks." In Wireless Technologies. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-61350-101-6.ch608.

Full text

Abstract:

Dynamic location of mobile users aims to deliver incoming calls to destination users. Most location algorithms keep track of mobile users through a predefined location area. The design of these location algorithms is focused to minimize the generated signaling traffic. There are three basic approaches to design location algorithms, namely distance-based, time-based and movement-based. In this Chapter we focus only on the movement-based algorithm since it achieves a good compromise between complexity and performance. We minimize a cost function for this dynamic movement-based location algorithm in order to find an optimum threshold in the number of updates. Counting the number of wireless cell crossing during inter-call times is a fundamental issue for our analysis. We use renewal theory to capture the probabilistic structure of this model, and it is general enough to include a variety of probability distributions for modeling cell residence times (CRT) in exponentially distributed location areas and hyperexponentially distributed intercall times. We present numerical results regarding some important distributions.

APA, Harvard, Vancouver, ISO, and other styles

3

Dai, Yuan-Shun, and Jack Dongarra. "Reliability and Performance Models for Grid Computing." In Grid and Cloud Computing. IGI Global, 2012. http://dx.doi.org/10.4018/978-1-4666-0879-5.ch106.

Full text

Abstract:

Grid computing is a newly developed technology for complex systems with large-scale resource sharing, wide-area communication, and multi-institutional collaboration. It is hard to analyze and model the Grid reliability because of its largeness, complexity and stiffness. Therefore, this chapter introduces the Grid computing technology, presents different types of failures in grid system, models the grid reliability with star structure and tree structure, and finally studies optimization problems for grid task partitioning and allocation. The chapter then presents models for star-topology considering data dependence and tree-structure considering failure correlation. Evaluation tools and algorithms are developed, evolved from Universal generating function and Graph Theory. Then, the failure correlation and data dependence are considered in the model. Numerical examples are illustrated to show the modeling and analysis.

APA, Harvard, Vancouver, ISO, and other styles

4

Dai, Yuan-Shun, and Jack Dongarra. "Reliability and Performance Models for Grid Computing." In Handbook of Research on Scalable Computing Technologies. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-60566-661-7.ch010.

Full text

Abstract:

Grid computing is a newly developed technology for complex systems with large-scale resource sharing, wide-area communication, and multi-institutional collaboration. It is hard to analyze and model the Grid reliability because of its largeness, complexity and stiffness. Therefore, this chapter introduces the Grid computing technology, presents different types of failures in grid system, models the grid reliability with star structure and tree structure, and finally studies optimization problems for grid task partitioning and allocation. The chapter then presents models for star-topology considering data dependence and treestructure considering failure correlation. Evaluation tools and algorithms are developed, evolved from Universal generating function and Graph Theory. Then, the failure correlation and data dependence are considered in the model. Numerical examples are illustrated to show the modeling and analysis.

APA, Harvard, Vancouver, ISO, and other styles

5

Lahmiri, Salim. "On Simulation Performance of Feedforward and NARX Networks Under Different Numerical Training Algorithms." In Advances in Systems Analysis, Software Engineering, and High Performance Computing. IGI Global, 2016. http://dx.doi.org/10.4018/978-1-4666-8823-0.ch005.

Full text

Abstract:

This chapter focuses on comparing the forecasting ability of the backpropagation neural network (BPNN) and the nonlinear autoregressive moving average with exogenous inputs (NARX) network trained with different algorithms; namely the quasi-Newton (Broyden-Fletcher-Goldfarb-Shanno, BFGS), conjugate gradient (Fletcher-Reeves update, Polak-Ribiére update, Powell-Beale restart), and Levenberg-Marquardt algorithm. Three synthetic signals are generated to conduct experiments. The simulation results showed that in general the NARX which is a dynamic system outperforms the popular BPNN. In addition, conjugate gradient algorithms provide better prediction accuracy than the Levenberg-Marquardt algorithm widely used in the literature in modeling exponential signal. However, the LM performed the best when used for forecasting the Moroccan and South African stock price indices under both the BPNN and NARX systems.

APA, Harvard, Vancouver, ISO, and other styles

6

Ruttico, Pierpaolo. "Innovative Construction Systems." In Additive Manufacturing. IGI Global, 2020. http://dx.doi.org/10.4018/978-1-5225-9624-0.ch002.

Full text

Abstract:

With the emergence of a new materialism in architecture and as a result of the ongoing advancements in digital technologies, computer numerically controlled (CNC) fabrication and 3D-printing are rapidly gaining popularity within the building construction industry. Robots, CNC machines, and algorithmic programming allow us to create new construction systems and innovative designs that otherwise might not be possible. This chapter analyzes adaptive and flexible systems that facilitate the design and the production processes of mass-customized building components through digital fabrication and assembly. The aspiration is to achieve morphological complexity and performance in material constituents: an engineering computational design process that envisions a sustainable built environment, with higher-level functionality and higher-level integration between material system and environment.

APA, Harvard, Vancouver, ISO, and other styles

7

Ruttico, Pierpaolo. "Innovative Construction Systems." In Advances in Media, Entertainment, and the Arts. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-3993-3.ch017.

Full text

Abstract:

With the emergence of a new materialism in architecture and as a result of the ongoing advancements in digital technologies, computer numerically controlled (CNC) fabrication and 3D-printing are rapidly gaining popularity within the building construction industry. Robots, CNC machines, and algorithmic programming allow us to create new construction systems and innovative designs that otherwise might not be possible. This chapter analyzes adaptive and flexible systems that facilitate the design and the production processes of mass-customized building components through digital fabrication and assembly. The aspiration is to achieve morphological complexity and performance in material constituents: an engineering computational design process that envisions a sustainable built environment, with higher-level functionality and higher-level integration between material system and environment.

APA, Harvard, Vancouver, ISO, and other styles

8

Lakshmivarahan, S., and Sudarshan K. Dhall. "Parallel Machines And Models — An Overview." In Parallel Computing Using the Prefix Problem. Oxford University Press, 1994. http://dx.doi.org/10.1093/oso/9780195088496.003.0007.

Full text

Abstract:

This chapter provides an overview of many issues related to the analysis of parallel algorithms in general. Starting with a discussion of the need for parallelism, a classification of parallel architectures, the need and the use of parallel models in algorithm development and various measures for quantifying the performance of parallel algorithms are presented. The definition, the role, and the properties of the key parallel complexity class called NC (Nick’s Class) are then described. This chapter concludes with a discussion of a basic result called Brent’s inequality and the derivation of a simple lower bound on the parallel time complexity. The conventional approach to engineering design critically depends on laboratory testing of scaled models — witness wind tunnel testing of models of aircraft and its parts. While such an approach has resulted in considerable success, it often involves destructive testing and is time consuming. It is said that it took nearly ten years and approximately three billion dollars to develop the now commercially successful Boeing 747 aircraft used in long-haul commercial flights. Computer simulation provides a convenient and economically attractive alternative. In simulation, the physical processes of interest are represented by a system of non-linear partial differential equations involving the three space dimensions and the time. These model equations are solved numerically using the finite difference or finite element methods. The behavior of the solution of these model equations provides insight on the effectiveness of the model in describing the physical phenomenon of interest, be it a model of an aircraft or a model of a weather phenomenon, etc. This approach, based on computer simulations has several inherent advantages. It is certainly non-destructive and easily allows for the analysis of the quality of the model for various combinations of initial and boundary conditions and the values of many key parameters of interest. The time required to complete a model run is a direct function of a number of factors. The number of grid points in space and time, the nature of the discretization scheme, such as, finite difference, finite elements, etc., the non-linearity and the coupling between the variables in the models.

APA, Harvard, Vancouver, ISO, and other styles

9

Lahmiri, Salim. "An Exploration of Backpropagation Numerical Algorithms in Modeling US Exchange Rates." In Advances in Business Information Systems and Analytics. IGI Global, 2015. http://dx.doi.org/10.4018/978-1-4666-7272-7.ch022.

Full text

Abstract:

This chapter applies the Backpropagation Neural Network (BPNN) trained with different numerical algorithms and technical analysis indicators as inputs to forecast daily US/Canada, US/Euro, US/Japan, US/Korea, US/Swiss, and US/UK exchange rate future price. The training algorithms are the Fletcher-Reeves, Polak-Ribiére, Powell-Beale, quasi-Newton (Broyden-Fletcher-Goldfarb-Shanno, BFGS), and the Levenberg-Marquardt (LM). The standard Auto Regressive Moving Average (ARMA) process is adopted as a reference model for comparison. The performance of each BPNN and ARMA process is measured by computing the Mean Absolute Error (MAE), Mean Absolute Deviation (MAD), and Mean of Squared Errors (MSE). The simulation results reveal that the LM algorithm is the best performer and show strong evidence of the superiority of the BPNN over ARMA process. In sum, because of the simplicity and effectiveness of the approach, it could be implemented for real business application problems to predict US currency exchange rate future price.

APA, Harvard, Vancouver, ISO, and other styles

10

Júnior, João Lameu da Silva, and Harrson Silva Santana. "Experimental and Numerical Analyses of a Micro-Heat Exchanger for Ethanol Excess Recovery From Biodiesel." In Process Analysis, Design, and Intensification in Microfluidics and Chemical Engineering. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-7138-4.ch006.

Full text

Abstract:

The use of micro-heat exchangers increased with the advancement of microfluidics. These microdevices present some advantages like elevated surface area-to-volume ratio resulting in high heat transfer rates. Micro-heat exchanger with phase change is a new application of such devices. The simultaneous momentum, heat, and mass transfer at microscale still require investigations due to the inherent complexity. The main goal of the chapter is to demonstrate experimentally and numerically the capability of the micro-heat exchanger use in the continuous process of ethanol excess recovery from the biodiesel. The influence of flow rate, ethanol/biodiesel molar ratio, and temperature on the ethanol evaporation performance was evaluated. The flow rate and the ethanol/biodiesel molar ratio influenced negatively the evaporation. In contrast, the temperature was affected positively. The mathematical model was able to capture the main features of the continuous evaporation; however, further improvements must be performed in order to consider the thermodynamics characteristics.

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Complexity and performance of numerical algorithms {Numerical analysis"

1

Wu, Bin, and C. Steve Suh. "On the Temporal Network Analysis With Link Prediction." In ASME 2018 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/imece2018-88101.

Full text

Abstract:

Literature review shows that much effort has been given to model physical systems involving a large number of interacting constituents. As a network evolves its constituents (or nodes) and associated links would either increase or decrease or both. It is a challenge to extract the specifics that underlie the evolution of a network or indicate the addition and/or removal of links in time. Similarity-based algorithm, Maximum likelihood methods, and Probabilistic models are 3 mainstream methods for link prediction. Methods incorporating topological feature and node attribute are shown to be more

APA, Harvard, Vancouver, ISO, and other styles

2

Urquiza, G., J. O. Davalos, J. C. Garcia, et al. "Parametric Study of Showerhead Film Cooling Performance on a Gas Turbine Blade." In ASME 2014 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/imece2014-38571.

Full text

Abstract:

Gas turbine power and efficiency have direct relation with inlet gas temperature. However, high gas temperature could cause thermal damage to gas turbine blade material. Gas turbine blade could be cooled using the so-called film cooling technique which is necessary to ensure blade material integrity. In film cooling, air from compressor is injected through internal blade ducts. The air leaves the internal ducts through holes placed on blade surface, creating a cooling film on the blade surface. Operating conditions and hole geometrical factors can influence the cooling effectiveness. Several i

APA, Harvard, Vancouver, ISO, and other styles

3

Wei, Yixiong, Qifu Wang, Yingjun Wang, Yunbao Huang, and Linchi Zhang. "Acceleration of Modal Analysis by FMM Based on DRBEM." In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-70596.

Full text

Abstract:

This paper proposes a novel algorithm to accelerate the process of modal analysis in 3D elastodynamic problems in BEM (boundary element method) with high accuracy. Because of low efficiency and high cost, conventional BEM is rarely used for solving 3D elastodynamics problems in engineering problems. With applying the DRBEM (dual reciprocity boundary element method) to form new integral equations of 3D elastodynamics problems to reduce time complexity by using reciprocity method twice, we introduce modified FMM (fast multipole method) to simplify the computation process and improve the efficien

APA, Harvard, Vancouver, ISO, and other styles

4

Senkerik, Roman, Donald Davendra, Ivan Zelinka, and Zuzana Oplatkova. "Influence of chaotic dynamics on the performance of evolutionary algorithms - An initial study." 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.4756212.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Volna, Eva. "Effect of metrics on A* based algorithms performance." In INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS (ICNAAM 2017). Author(s), 2018. http://dx.doi.org/10.1063/1.5043704.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Skala, Vaclav. "Point-in-convex polygon and point-in-convex polyhedron algorithms with O(1) complexity using space subdivision." In INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2015 (ICNAAM 2015). Author(s), 2016. http://dx.doi.org/10.1063/1.4952270.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Costa, Lino, Isabel A. C. P. Espírito Santo, and Pedro Oliveira. "Bootstrap performance profiles in stochastic algorithms assessment." In PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2014 (ICNAAM-2014). AIP Publishing LLC, 2015. http://dx.doi.org/10.1063/1.4912429.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Wei, Ming, Yonghong Wang, and Huafen Song. "Sensitivity Analysis and Numerical Stability Analysis of the Algorithms for Predicting the Performance of Turbines." In ASME Turbo Expo 2013: Turbine Technical Conference and Exposition. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/gt2013-94482.

Full text

Abstract:

Sensitivity and numerical stability of an algorithm are two of the most important criteria to evaluate its performance. For all published turbine flow models, except Wang method, can be named the ‘top-down’ method (TDM) in which the performance of turbines is calculated from the first stage to the last stage row by row; only Wang method originally proposed by Yonghong Wang can be named the ‘bottom-up’ method (BUM) in which the performance of turbines is calculated from the last stage to the first stage row by row. To find the reason why the stability of the two methods is of great difference,

APA, Harvard, Vancouver, ISO, and other styles

9

Almeida, P., C. Gibert, F. Thouverez, and J. P. Ousty. "Numerical Analysis of Bladed Disk-Casing Contact With Friction and Wear." In ASME Turbo Expo 2015: Turbine Technical Conference and Exposition. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/gt2015-43435.

Full text

Abstract:

In order to increase the aerodynamic performances of their engines, aircraft engine manufacturers try to minimize the clearance between rotating and stationary parts in axial and centrifugal compressors. Consequently, the probability of contact increases, leading to undesirable phenomena caused by forced excitation of the natural modes, or by modal interaction. Due to the complexity of these phenomena, many numerical studies have been conducted to gain a better understanding of the physics associated with them, looking primarily at their respective influence on potential unstable behaviors. Ho

APA, Harvard, Vancouver, ISO, and other styles

10

Barlow, R. C., C. Padmanabhan, and Rajendra Singh. "Computational Issues Associated With Gear Rattle Analysis: Part II — Evaluation Criteria for Numerical Algorithms." In ASME 1992 Design Technical Conferences. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/detc1992-0065.

Full text

Abstract:

Abstract The main focus of this study is to establish evaluation criteria for direct time domain integration algorithms used to solve gear rattle type problems. Such criteria may be used to identify specific numerical problems encountered. The ultimate goal obviously is to find reasonably accurate and reliable methods of solution for such physical systems. Six case studies of increasing complexity, linear to highly non-linear, are solved using well known algorithms. The solutions to the linear model are verified by using analytical results. Non-linear model solutions as yielded by different al

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!