A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Guest Editors' Introduction: Multigrid Computing
2006
Computing in science & engineering (Print)
Preserved Fulltext
M ultigrid methods are among the most important algorithms for computational scientists because they're the most efficient solvers for a wide range of problems. ...
The modern era of multigrid methods began more than 30 years ago with the publication of Achi Brandt's seminal papers. 1,2 Although it was originally successful for solving elliptic partial differential ...
An important issue is the constant in the complexity estimates because it ultimately decides which algorithm is best. ...
doi:10.1109/mcse.2006.109
fatcat:uas2az2i3ndwniygxmedk44d7m
Page 728 of American Society of Civil Engineers. Collected Journals Vol. 127, Issue 9
[page]
2001
American Society of Civil Engineers. Collected Journals
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Cahyono (1993) carried out a detailed study in which he compared 36 of the most popular finite-difference algorithms for solving the advection problem, including the TVD and ULTIMATE schemes. ...
Stefan’
ABSTRACT: The present paper presents an accurate numerical algorithm for the simulation of 2D solute/heat transport by unsteady advection-diffusion-reaction. ...
Determination of Stresses and Ultimate Loads for Composite Plates with Elastic Inclusions
2017
Ukrainian Journal of Mechanical Engineering and Materials Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In the article, the algorithm for determination of stresses in anisotropic plates with elastic inclusions of another anisotropic material was developed on the basis of complex singular integral equations ...
Main Material Presentation Let us consider the Hoffman strength criterion for composite materials, which is necessary for further calculations and takes into account the difference between the ultimate ...
The efficiency and simplicity of use of the developed numerical algorithm are exemplified by calculation of stresses at inclusions of various shapes and by determination of the ultimate loads. compression ...
doi:10.23939/ujmems2017.02.038
fatcat:5de7dglqrvdttgcpamcjbac3rq
Design and Deployment of Visible-Thermal Biometric Surveillance Systems
2007
2007 IEEE Conference on Computer Vision and Pattern Recognition
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Sometimes systems must be deployed sooner than would allow for the development cycle of complex new algorithms, and must be more robust than most such algorithms can be expected to be on short notice. ...
For the case 1 ...
Sometimes systems must be deployed sooner than would allow for the development cycle of complex new algorithms, and must be more robust than most such algorithms can be expected to be on short notice. ...
doi:10.1109/cvpr.2007.383531
dblp:conf/cvpr/Socolinsky07
fatcat:sfbl22uno5fztfnlmcoxk47zeu
Numerical limit analysis of the ultimate load bearing capacity of a pier foundation under complex load
2019
MATEC Web of Conferences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, numerical limit analysis has been employed to analyze the load bearing capacity for the scheme of selection of a pier foundation of a 100 MW wind farm in certain collapsible loess geology ...
The ultimate load bearing capacity design, as an important part in the design phase of this foundation form, is not sufficiently in terms of design theory and the checking method, especially for application ...
[15, 16] calculated the undrained ultimate load bearing capacity and stability of a foundation pit support for a strip foundation under complex force conditions by applying the numerical limit analysis ...
doi:10.1051/matecconf/201927702018
fatcat:vu7xc4oupnaddggxfoghfp3hjy
Extraction of Numerical Residues in Families of Levelings
2013
2013 XXVI Conference on Graphics, Patterns and Images
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We also present an efficient algorithm for ultimate attribute leveling computation by using a structure called tree of shapes. ...
Our algorithm for computating ultimate attribute leveling is based on the fact (proved in this work) that levelings can be obtained by pruning nodes from the tree of shapes. ...
for computing ultimate attribute leveling which is an extension of the algorithm for computing ultimate attribute opening presented by Fabrizio and Marcotegui [4] (differently to latter work, our algorithm ...
doi:10.1109/sibgrapi.2013.55
dblp:conf/sibgrapi/AlvesMCH13
fatcat:2kvw6wj2bbchrkzezj3gehffiq
Numerical integration of rate-independent BCC single crystal plasticity models: comparative study of two classes of numerical algorithms
2016
International Journal for Numerical Methods in Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The first algorithm is based on the usual return-mapping integration scheme, while the second follows the so-called ultimate scheme. ...
Although these algorithms are applied in this paper to Body-Centered-Cubic (BCC) crystal structures, they are quite general and suitable for integrating the constitutive equations for other crystal structures ...
Ultimate algorithm For convenience, the Eulerian formulation is used in the development of the following version of the so-called ultimate algorithm. ...
doi:10.1002/nme.5215
fatcat:khjdtkgnavfcbicorkb4s3fpyu
Page 4723 of Mathematical Reviews Vol. , Issue 94h
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Although it can be proved that this algorithm ultimately converges quadrati- cally, there is no proof of its global convergence. However, the algorithm is shown to be backward numerically stable. ...
For real matrices, a new version of the authors’ algorithm is introduced (al- gorithm 2) in order to avoid complex arithmetic. ...
Page 8549 of Mathematical Reviews Vol. , Issue 2001K
[page]
2001
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Numerical expressions to compute the linear complexity of such sequences are given as well as practical rules to design 2nd-order nonlinear filterings which preserve the maximal linear complexity.” ...
They proved that any ultimately periodic binary sequence can be produced by an FCSR, by developing an algorithm for finding the shortest FCSR that produces the given binary sequence. ...
Modeling of Insurance Data through Two Heavy Tailed Distributions: Computations of Some of Their Actuarial Quantities through Simulation from Their Equilibrium Distributions and the Use of Their Convolutions
2016
Journal of Mathematical Finance
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
An attempt has also been made to obtain numerical values to the probability function for the number of claims until ruin in case of zero initial surplus under these claim severity distributions and this ...
of ultimate ruin. ...
The probability of ultimate ruin for the Burr XII distribution was computed through two numerical algorithms namely the stable recursive algorithm and the method of product integration in [13] . ...
doi:10.4236/jmf.2016.63031
fatcat:6szpwo2mm5hedajsf243vg7lqe
Estimating the Quality of an Object-Oriented Software System Using Graph Algorithms
2012
International Journal of Computer and Electrical Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The proposed structural software metrics can estimate the quality of the ultimate software system based on the possible maximum relational complexities between the classes of its class diagram. ...
Then, the graph algorithms are applied based on the longest path algorithm to propose a new set of structural software metrics. ...
= 1 to n do for j = 1 to n do replace the longest path between vertices i and j to lij; end As the longest path algorithm has been solved for acyclic graphs with nonnegative weights [9, 10] , in this ...
doi:10.7763/ijcee.2012.v4.535
fatcat:wuqfhdoux5gvxajj6fiq267vnq
Preface to the Special Issue: Computational approaches for the modeling of complex crack path and patterns
2019
International Journal of Fracture
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this special issue, we collect the contributions of researchers and scientists that are working on advanced numerical algorithms to explore possible future developments of numerical methods for crack ...
Recent formulations based on energetic reasoning opened an interesting avenue for the definition of new algorithms. Popular numerical techniques are based M. ...
doi:10.1007/s10704-019-00408-3
fatcat:fg7o24yq3fdf5hpr7qzzd66hma
Decidability of the HD0L ultimate periodicity problem
[article]
2013
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
In this paper we prove the decidability of the HD0L ultimate periodicity problem. ...
We did not compute the complexity of the algorithm provided by our proof of the HD0L ultimate periodicity problem. ...
Recently, in [Bell, Charlier, Fraenkel, and Rigo 2009] , a positive answer has been given for a (large) class of numeration systems including for instance the Fibonacci numeration system. ...
arXiv:1111.3268v3
fatcat:pvcujbmo45c2zcwn2oxlgjifay
On the ultimate convex hull algorithm in practice
1985
Pattern Recognition Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The results suggest that although the O(n log h) algorithms may be the 'ultimate' ones in theory, they are of little practical value from the point of view of running time. ...
Here a modification of their algorithm is proposed that is believed to run in O(n) expected time for many reasonable distributions of points. ...
Kirkpatrick and Seidel [13] have presented an algorithm for determining the planar convex hull with worst case time complexity O(n log h), sensitive to both n and h. ...
doi:10.1016/0167-8655(85)90039-x
fatcat:4e7tf3vkyjervb3e3rv6ftxldm
A New High Order Algorithm with Low Computational Complexity for Electric Field Simulation
2010
Journal of Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Approach: Our recent research had found a new method with lower complexity and can simulate the problem faster than the existing FDTD algorithm. ...
Problem statement: This research reported on new approach to improve speed of simulation time for free space electric wave propagation from an antenna. ...
CONCLUSION The ultimate objective of this study was to develop a new algorithm that has lower overall computational complexity for finite-difference time-domain scheme. ...
doi:10.3844/jcssp.2010.769.744
fatcat:w4yvw6w7lfas3jffkbwjyl7sxi
« Previous
Showing results 1 — 15 out of 248,418 results