Next Issue
Volume 6, March
Previous Issue
Volume 5, September
 
 

Computation, Volume 5, Issue 4 (December 2017) – 8 articles

  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list.
  • You may sign up for e-mail alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.
Order results
Result details
Section
Select all
Export citation of selected articles as:
196 KiB  
Review
Challenges for Theory and Computation
by Karlheinz Schwarz
Computation 2017, 5(4), 49; https://doi.org/10.3390/computation5040049 - 04 Dec 2017
Cited by 1 | Viewed by 3203
Abstract
The routinely made assumptions for simulating solid materials are briefly summarized, since they need to be critically assessed when new aspects become important, such as excited states, finite temperature, time-dependence, etc. The significantly higher computer power combined with improved experimental data open new [...] Read more.
The routinely made assumptions for simulating solid materials are briefly summarized, since they need to be critically assessed when new aspects become important, such as excited states, finite temperature, time-dependence, etc. The significantly higher computer power combined with improved experimental data open new areas for interdisciplinary research, for which new ideas and concepts are needed. Full article
(This article belongs to the Special Issue In Memory of Walter Kohn—Advances in Density Functional Theory)
811 KiB  
Article
A Holistic Scalable Implementation Approach of the Lattice Boltzmann Method for CPU/GPU Heterogeneous Clusters
by Christoph Riesinger, Arash Bakhtiari, Martin Schreiber, Philipp Neumann and Hans-Joachim Bungartz
Computation 2017, 5(4), 48; https://doi.org/10.3390/computation5040048 - 30 Nov 2017
Cited by 30 | Viewed by 5454
Abstract
Heterogeneous clusters are a widely utilized class of supercomputers assembled from different types of computing devices, for instance CPUs and GPUs, providing a huge computational potential. Programming them in a scalable way exploiting the maximal performance introduces numerous challenges such as optimizations for [...] Read more.
Heterogeneous clusters are a widely utilized class of supercomputers assembled from different types of computing devices, for instance CPUs and GPUs, providing a huge computational potential. Programming them in a scalable way exploiting the maximal performance introduces numerous challenges such as optimizations for different computing devices, dealing with multiple levels of parallelism, the application of different programming models, work distribution, and hiding of communication with computation. We utilize the lattice Boltzmann method for fluid flow as a representative of a scientific computing application and develop a holistic implementation for large-scale CPU/GPU heterogeneous clusters. We review and combine a set of best practices and techniques ranging from optimizations for the particular computing devices to the orchestration of tens of thousands of CPU cores and thousands of GPUs. Eventually, we come up with an implementation using all the available computational resources for the lattice Boltzmann method operators. Our approach shows excellent scalability behavior making it future-proof for heterogeneous clusters of the upcoming architectures on the exaFLOPS scale. Parallel efficiencies of more than 90 % are achieved leading to 2604.72 GLUPS utilizing 24,576 CPU cores and 2048 GPUs of the CPU/GPU heterogeneous cluster Piz Daint and computing more than 6.8 × 10 9 lattice cells. Full article
(This article belongs to the Section Computational Engineering)
Show Figures

Figure 1

3442 KiB  
Article
Nonlinear-Adaptive Mathematical System Identification
by Timothy Sands
Computation 2017, 5(4), 47; https://doi.org/10.3390/computation5040047 - 30 Nov 2017
Cited by 22 | Viewed by 4682
Abstract
By reversing paradigms that normally utilize mathematical models as the basis for nonlinear adaptive controllers, this article describes using the controller to serve as a novel computational approach for mathematical system identification. System identification usually begins with the dynamics, and then seeks to [...] Read more.
By reversing paradigms that normally utilize mathematical models as the basis for nonlinear adaptive controllers, this article describes using the controller to serve as a novel computational approach for mathematical system identification. System identification usually begins with the dynamics, and then seeks to parameterize the mathematical model in an optimization relationship that produces estimates of the parameters that minimize a designated cost function. The proposed methodology uses a DC motor with a minimum-phase mathematical model controlled by a self-tuning regulator without model pole cancelation. The normal system identification process is briefly articulated by parameterizing the system for least squares estimation that includes an allowance for exponential forgetting to deal with time-varying plants. Next, towards the proposed approach, the Diophantine equation is derived for an indirect self-tuner where feedforward and feedback controls are both parameterized in terms of the motor’s math model. As the controller seeks to nullify tracking errors, the assumed plant parameters are adapted and quickly converge on the correct parameters of the motor’s math model. Next, a more challenging non-minimum phase system is investigated, and the earlier implemented technique is modified utilizing a direct self-tuner with an increased pole excess. The nominal method experiences control chattering (an undesirable characteristic that could potentially damage the motor during testing), while the increased pole excess eliminates the control chattering, yet maintains effective mathematical system identification. This novel approach permits algorithms normally used for control to instead be used effectively for mathematical system identification. Full article
(This article belongs to the Section Computational Engineering)
Show Figures

Figure 1

2731 KiB  
Review
Dynamic Data-Driven Modeling for Ex Vivo Data Analysis: Insights into Liver Transplantation and Pathobiology
by David Sadowsky, Andrew Abboud, Anthony Cyr, Lena Vodovotz, Paulo Fontes, Ruben Zamora and Yoram Vodovotz
Computation 2017, 5(4), 46; https://doi.org/10.3390/computation5040046 - 23 Nov 2017
Cited by 1 | Viewed by 3753
Abstract
Extracorporeal organ perfusion, in which organs are preserved in an isolated, ex vivo environment over an extended time-span, is a concept that has led to the development of numerous alternative preservation protocols designed to better maintain organ viability prior to transplantation. These protocols [...] Read more.
Extracorporeal organ perfusion, in which organs are preserved in an isolated, ex vivo environment over an extended time-span, is a concept that has led to the development of numerous alternative preservation protocols designed to better maintain organ viability prior to transplantation. These protocols offer researchers a novel opportunity to obtain extensive sampling of isolated organs, free from systemic influences. Data-driven computational modeling is a primary means of integrating the extensive and multivariate data obtained in this fashion. In this review, we focus on the application of dynamic data-driven computational modeling to liver pathophysiology and transplantation based on data obtained from ex vivo organ perfusion. Full article
(This article belongs to the Section Computational Biology)
Show Figures

Figure 1

5528 KiB  
Article
Deformable Cell Model of Tissue Growth
by Nikolai Bessonov and Vitaly Volpert
Computation 2017, 5(4), 45; https://doi.org/10.3390/computation5040045 - 30 Oct 2017
Cited by 1 | Viewed by 4285
Abstract
This paper is devoted to modelling tissue growth with a deformable cell model. Each cell represents a polygon with particles located at its vertices. Stretching, bending and pressure forces act on particles and determine their displacement. Pressure-dependent cell proliferation is considered. Various patterns [...] Read more.
This paper is devoted to modelling tissue growth with a deformable cell model. Each cell represents a polygon with particles located at its vertices. Stretching, bending and pressure forces act on particles and determine their displacement. Pressure-dependent cell proliferation is considered. Various patterns of growing tissue are observed. An application of the model to tissue regeneration is illustrated. Approximate analytical models of tissue growth are developed. Full article
(This article belongs to the Section Computational Biology)
Show Figures

Figure 1

758 KiB  
Article
Multiresolution Modeling of Semidilute Polymer Solutions: Coarse-Graining Using Wavelet-Accelerated Monte Carlo
by Animesh Agarwal, Brooks D. Rabideau and Ahmed E. Ismail
Computation 2017, 5(4), 44; https://doi.org/10.3390/computation5040044 - 28 Sep 2017
Viewed by 3569
Abstract
We present a hierarchical coarse-graining framework for modeling semidilute polymer solutions, based on the wavelet-accelerated Monte Carlo (WAMC) method. This framework forms a hierarchy of resolutions to model polymers at length scales that cannot be reached via atomistic or even standard coarse-grained simulations. [...] Read more.
We present a hierarchical coarse-graining framework for modeling semidilute polymer solutions, based on the wavelet-accelerated Monte Carlo (WAMC) method. This framework forms a hierarchy of resolutions to model polymers at length scales that cannot be reached via atomistic or even standard coarse-grained simulations. Previously, it was applied to simulations examining the structure of individual polymer chains in solution using up to four levels of coarse-graining (Ismail et al., J. Chem. Phys., 2005, 122, 234901 and Ismail et al., J. Chem. Phys., 2005, 122, 234902), recovering the correct scaling behavior in the coarse-grained representation. In the present work, we extend this method to the study of polymer solutions, deriving the bonded and non-bonded potentials between coarse-grained superatoms from the single chain statistics. A universal scaling function is obtained, which does not require recalculation of the potentials as the scale of the system is changed. To model semi-dilute polymer solutions, we assume the intermolecular potential between the coarse-grained beads to be equal to the non-bonded potential, which is a reasonable approximation in the case of semidilute systems. Thus, a minimal input of microscopic data is required for simulating the systems at the mesoscopic scale. We show that coarse-grained polymer solutions can reproduce results obtained from the more detailed atomistic system without a significant loss of accuracy. Full article
(This article belongs to the Special Issue Computation in Molecular Modeling)
Show Figures

Figure 1

274 KiB  
Review
Self-Organizing Map for Characterizing Heterogeneous Nucleotide and Amino Acid Sequence Motifs
by Xuhua Xia
Computation 2017, 5(4), 43; https://doi.org/10.3390/computation5040043 - 26 Sep 2017
Cited by 2 | Viewed by 3336
Abstract
A self-organizing map (SOM) is an artificial neural network algorithm that can learn from the training data consisting of objects expressed as vectors and perform non-hierarchical clustering to represent input vectors into discretized clusters, with vectors assigned to the same cluster sharing similar [...] Read more.
A self-organizing map (SOM) is an artificial neural network algorithm that can learn from the training data consisting of objects expressed as vectors and perform non-hierarchical clustering to represent input vectors into discretized clusters, with vectors assigned to the same cluster sharing similar numeric or alphanumeric features. SOM has been used widely in transcriptomics to identify co-expressed genes as candidates for co-regulated genes. I envision SOM to have great potential in characterizing heterogeneous sequence motifs, and aim to illustrate this potential by a parallel presentation of SOM with a set of numerical vectors and a set of equal-length sequence motifs. While there are numerous biological applications of SOM involving numerical vectors, few studies have used SOM for heterogeneous sequence motif characterization. This paper is intended to encourage (1) researchers to study SOM in this new domain and (2) computer programmers to develop user-friendly motif-characterization SOM tools for biologists. Full article
(This article belongs to the Section Computational Biology)
486 KiB  
Article
A Diagonally Updated Limited-Memory Quasi-Newton Method for the Weighted Density Approximation
by Matthew Chan, Rogelio Cuevas-Saavedra, Debajit Chakraborty and Paul W. Ayers
Computation 2017, 5(4), 42; https://doi.org/10.3390/computation5040042 - 26 Sep 2017
Cited by 2 | Viewed by 3973
Abstract
We propose a limited-memory quasi-Newton method using the bad Broyden update and apply it to the nonlinear equations that must be solved to determine the effective Fermi momentum in the weighted density approximation for the exchange energy density functional. This algorithm has advantages [...] Read more.
We propose a limited-memory quasi-Newton method using the bad Broyden update and apply it to the nonlinear equations that must be solved to determine the effective Fermi momentum in the weighted density approximation for the exchange energy density functional. This algorithm has advantages for nonlinear systems of equations with diagonally dominant Jacobians, because it is easy to generalize the method to allow for periodic updates of the diagonal of the Jacobian. Systematic tests of the method for atoms show that one can determine the effective Fermi momentum at thousands of points in less than fifteen iterations. Full article
(This article belongs to the Special Issue In Memory of Walter Kohn—Advances in Density Functional Theory)
Show Figures

Figure 1

Previous Issue
Next Issue
Back to TopTop