Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 829 records · Page 46

Deformable Image Registration of Liver With Consideration of Lung Sliding Motion

Purpose: A feature based deformable registration model with sliding transformation was developed in the upper abdominal region for liver cancer. Methods: A two-step thin-plate spline (bi-TPS) algorithm was implemented to deformably register the liver organ. The first TPS registration was performed to exclusively quantify the sliding displacement component. A manual segmentation of the thoracic and abdominal cavity was performed as a priori knowledge. Tissue feature points were automatically identified inside the segmented contour on the images. The scale invariant feature transform method was utilized to match feature points that served as landmarks for the subsequent TPS registration to derive the sliding displacement vector field. To a good approximation, only motion along superior/inferior (SI) direction of voxels on each slice was averaged to obtain the sliding displacement for each slice. A second TPS transformation, as the last step, was carried out to obtain the local deformation field. Manual identification of bifurcation on liver, together with the manual segmentation of liver organ, was employed as a ''ground truth'' for assessing the algorithm's performance. Results: The proposed two-step TPS was assessed with six liver patients. The average error of liver bifurcation between manual identification and calculation for these patients was less than 1.8 mm. The residual errors between manual contour and propagated contour of liver organ using the algorithm fell in the range between 2.1 and 2.8 mm. An index of Dice similarity coefficient (DSC) between manual contour and calculated contour for liver tumor was 93.6% compared with 71.2% from the conventional TPS calculation. Conclusions: A high accuracy ({approx}2 mm) of the two-step feature based TPS registration algorithm was achievable for registering the liver organ. The discontinuous motion in the upper abdominal region was properly taken into consideration. Clinical implementation of the algorithm will find broad application in radiation therapy of liver cancer.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Detection of stars within ∼0.8 in of Kepler objects of interest

We present an algorithm to search for the faint spectrum of a second star mixed with the spectrum of a brighter star in high resolution spectra. We model optical stellar spectra as the sum of two input spectra drawn from a vast library of stars throughout the H-R diagram. From typical spectra having a resolution of R = 60,000, we are able to detect companions as faint as 1% relative to the primary star in approximately the V and R bandpasses of photometry. We are also able to find evidence for triple and quadruple systems, given that any additional companions are sufficiently bright. The precise threshold percentage depends on the signal-to-noise of the spectrum and the properties of the two stars. For cases of non-detection, we place a limit on the brightness of any potential companions. This algorithm is useful for detecting faint orbiting companions and background stars that are angularly close to a foreground target star. The size of the entrance slit to the spectrometer, 0.87 × 3 arcsec (typically), sets the angular domain within which the second star can be detected. We analyzed Keck-HIRES spectra of 1160 California Kepler Survey objects of interest (KOI) searching for the secondary spectra, with the two goals of alerting the community to two possible host stars of the transiting planet and to dilution of the light curve. We report 63 California KOI showing spectroscopic evidence of a secondary star.

79 ASTRONOMY AND ASTROPHYSICS↗

A combined Event-Driven/Time-Driven molecular dynamics algorithm for the simulation of shock waves in rarefied gases

A novel combined Event-Driven/Time-Driven (ED/TD) algorithm to speed-up the Molecular Dynamics simulation of rarefied gases using realistic spherically symmetric soft potentials is presented. Due to the low density regime, the proposed method correctly identifies the time that must elapse before the next interaction occurs, similarly to Event-Driven Molecular Dynamics. However, each interaction is treated using Time-Driven Molecular Dynamics, thereby integrating Newton's Second Law using the sufficiently small time step needed to correctly resolve the atomic motion. Although infrequent, many-body interactions are also accounted for with a small approximation. The combined ED/TD method is shown to correctly reproduce translational relaxation in argon, described using the Lennard-Jones potential. For densities between {rho}=10{sup -4}kg/m{sup 3} and {rho}=10{sup -1}kg/m{sup 3}, comparisons with kinetic theory, Direct Simulation Monte Carlo, and pure Time-Driven Molecular Dynamics demonstrate that the ED/TD algorithm correctly reproduces the proper collision rates and the evolution toward thermal equilibrium. Finally, the combined ED/TD algorithm is applied to the simulation of a Mach 9 shock wave in rarefied argon. Density and temperature profiles as well as molecular velocity distributions accurately match DSMC results, and the shock thickness is within the experimental uncertainty. For the problems considered, the ED/TD algorithm ranged from several hundred to several thousand times faster than conventional Time-Driven MD. Moreover, the force calculation to integrate the molecular trajectories is found to contribute a negligible amount to the overall ED/TD simulation time. Therefore, this method could pave the way for the application of much more refined and expensive interatomic potentials, either classical or first-principles, to Molecular Dynamics simulations of shock waves in rarefied gases, involving vibrational nonequilibrium and chemical reactivity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multiscale Analysis of Pebble Bed Reactors

– The PEBBED code was developed at the Idaho National Laboratory for design and analysis of pebble-bed high temperature reactors. The diffusion-depletion-pebble-mixing algorithm of the original PEBBED code was enhanced through coupling with the THERMIX-KONVEK code for thermal fluid analysis and by the COMBINE code for online cross section generation. The COMBINE code solves the B-1 or B-3 approximations to the transport equation for neutron slowing down and resonance interactions in a homogeneous medium with simple corrections for shadowing and thermal self-shielding. The number densities of materials within specified regions of the core are averaged and transferred to COMBINE from PEBBED for updating during the burnup iteration. The simple treatment of self-shielding in previous versions of COMBINE led to inaccurate results for cross sections and unsatisfactory core performance calculations. A new version of COMBINE has been developed that treats all levels of heterogeneity using the 1D transport code ANISN. In a 3-stage calculation, slowing down is performed in 167 groups for each homogeneous subregion (kernel, particle layers, graphite shell, control rod absorber annulus, etc.) Particles in a local average pebble are homogenized using ANISN then passed to the next (pebble) stage. A 1D transport solution is again performed over the pebble geometry and the homogenized pebble cross sections are passed to a 1-d radial model of a wedge of the pebble bed core. This wedge may also include homogeneous reflector regions and a control rod region composed of annuli of different absorbing regions. Radial leakage effects are therefore captured with discrete ordinates transport while axial and azimuthal effects are captured with a transverse buckling term. In this paper, results of various PBR models will be compared with comparable models from literature. Performance of the code will be assessed.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Bayesian inference of nonlinear unsteady aerodynamics from aeroelastic limit cycle oscillations

A Bayesian model selection and parameter estimation algorithm is applied to investigate the influence of nonlinear and unsteady aerodynamic loads on the limit cycle oscillation (LCO) of a pitching airfoil in the transitional Reynolds number regime. At small angles of attack, laminar boundary layer trailing edge separation causes negative aerodynamic damping leading to the LCO. The fluid–structure interaction of the rigid, but elastically mounted, airfoil and nonlinear unsteady aerodynamics is represented by two coupled nonlinear stochastic ordinary differential equations containing uncertain parameters and model approximation errors. Several plausible aerodynamic models with increasing complexity are proposed to describe the aeroelastic system leading to LCO. The likelihood in the posterior parameter probability density function (pdf) is available semi-analytically using the extended Kalman filter for the state estimation of the coupled nonlinear structural and unsteady aerodynamic model. The posterior parameter pdf is sampled using a parallel and adaptive Markov Chain Monte Carlo (MCMC) algorithm. The posterior probability of each model is estimated using the Chib–Jeliazkov method that directly uses the posterior MCMC samples for evidence (marginal likelihood) computation. The Bayesian algorithm is validated through a numerical study and then applied to model the nonlinear unsteady aerodynamic loads using wind-tunnel test data at various Reynolds numbers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Transport error estimation using residual Monte Carlo

The residual Monte Carlo (RMC) method is also known in the literature as sequential Monte Carlo and reduced-source Monte Carlo. Given a Monte Carlo method for solving a linear equation and an approximate solution to that system, the residual method enables use of essentially the same Monte Carlo algorithm to directly compute the additive error or “defect” associated with the approximate solution. As the size of the defect decreases relative to the size of the solution, the residual Monte Carlo method becomes increasingly efficient relative to the standard Monte Carlo (SMC) method. Here we present a new RMC algorithm for evaluating the space-angle error in S n radiation transport solutions, and provide computational examples demonstrating that it can be far more efficient than SMC for this purpose. Herein we also describe a particular pitfall that must be avoided if RMC is to be efficient, and explain why the performance of RMC can significantly differ between different transport problems and different quantities of interest for the same problem.

97 MATHEMATICS AND COMPUTING↗

Solving the $k$-Sparse Eigenvalue Problem with Reinforcement Learning

We examine the possibility of using a reinforcement learning (RL) algorithm to solve large-scale eigenvalue problems in which the desired the eigenvector can be approximated by a sparse vector with at most k nonzero elements, where k is relatively small compare to the dimension of the matrix to be partially diagonalized. Here, this type of problem arises in applications in which the desired eigenvector exhibits localization properties and in large-scale eigenvalue computations in which the amount of computational resource is limited. When the positions of these nonzero elements can be determined, we can obtain the k-sparse approximation to the original problem by computing eigenvalues of a k × k submatrix extracted from k rows and columns of the original matrix. We review a previously developed greedy algorithm for incrementally probing the positions of the nonzero elements in a k-sparse approximate eigenvector and show that the greedy algorithm can be improved by using an RL method to refine the selection of k rows and columns of the original matrix. We describe how to represent states, actions, rewards and policies in an RL algorithm designed to solve the k-sparse eigenvalue problem and demonstrate the effectiveness of the RL algorithm on two examples originating from quantum many-body physics.

97 MATHEMATICS AND COMPUTING↗

Heel effect adaptive flat field correction of digital x-ray detectors

Purpose: Anode heel effect renders large-scale background nonuniformities in digital radiographs. Conventional offset/gain calibration is performed at mono source-to-image distance (SID), and disregards the SID-dependent characteristic of heel effect. It results in a residual nonuniform background in the corrected radiographs when the SID settings for calibration and correction differ. In this work, the authors develop a robust and efficient computational method for digital x-ray detector gain correction adapted to SID-variant heel effect, without resorting to physical filters, phantoms, complicated heel effect models, or multiple-SID calibration and interpolation.Methods: The authors present the Duo-SID projection correction method. In our approach, conventional offset/gain calibrations are performed only twice, at the minimum and maximum SIDs of the system in typical clinical use. A fast iterative separation algorithm is devised to extract the detector gain and basis heel patterns from the min/max SID calibrations. The resultant detector gain is independent of SID, while the basis heel patterns are parameterized by the min- and max-SID. The heel pattern at any SID is obtained from the min-SID basis heel pattern via projection imaging principles. The system gain desired at a specific acquisition SID is then constructed using the projected heel pattern and detector gain map.Results: The method was evaluated for flat field and anatomical phantom image corrections. It demonstrated promising improvements over interpolation and conventional gain calibration/correction methods, lowering their correction errors by approximately 70% and 80%, respectively. The separation algorithm was able to extract the detector gain and heel patterns with less than 2% error, and the Duo-SID corrected images showed perceptually appealing uniform background across the detector.Conclusions: The Duo-SID correction method has substantially improved on conventional offset/gain corrections for digital x-ray imaging in an SID-variant environment. The technique is relatively simple, and can be easily incorporated into multiple-point gain calibration/correction techniques. It offers a potentially valuable tool for preprocessing digital x-ray images to boost image quality of mammography, chest and cardiac radiography, as well as automated computer aided diagnostic radiology.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Dimension Reduction and Redundancy Removal through Successive Schmidt Decompositions

Quantum computers are believed to have the ability to process huge data sizes, which can be seen in machine learning applications. In these applications, the data, in general, are classical. Therefore, to process them on a quantum computer, there is a need for efficient methods that can be used to map classical data on quantum states in a concise manner. On the other hand, to verify the results of quantum computers and study quantum algorithms, we need to be able to approximate quantum operations into forms that are easier to simulate on classical computers with some errors. Motivated by these needs, in this paper, we study the approximation of matrices and vectors by using their tensor products obtained through successive Schmidt decompositions. We show that data with distributions such as uniform, Poisson, exponential, or similar to these distributions can be approximated by using only a few terms, which can be easily mapped onto quantum circuits. The examples include random data with different distributions, the Gram matrices of iris flower, handwritten digits, 20newsgroup, and labeled faces in the wild. Similarly, some quantum operations, such as quantum Fourier transform and variational quantum circuits with a small depth, may also be approximated with a few terms that are easier to simulate on classical computers. Furthermore, we show how the method can be used to simplify quantum Hamiltonians: In particular, we show the application to randomly generated transverse field Ising model Hamiltonians. The reduced Hamiltonians can be mapped into quantum circuits easily and, therefore, can be simulated more efficiently.

97 MATHEMATICS AND COMPUTING↗

Robotic reconnaissance platform. I. Spectroscopic instruments with rangefinders

In this paper, basic principles of the design and implementation of a portable, multi-functional scientific instrument, operating from a robotic reconnaissance mobile platform are discussed. The current version of the instrument includes a multi-gas laser sensor, multi-functional spectrometer, isotopes identifier, cameras, and rangefinder. An additional set of sensors monitors temperature, pressure, humidity, and background radiation. All components are installed on a mini-robotic platform, which provides data acquisition, processing, and transmittance. The design focuses on the development of calibration-free, reliable, low power-consumption devices. To create a highly survivable, accurate, and reliable instrument, a concept of an inhomogeneous sensory network has been developed. Such a network combines non-identical sensors and provides cross-use of information received from different sensors to describe environmental conditions, to choose appropriate algorithms of data processing, and to achieve high accuracy gas-concentration measurements. The system uses the same lasers to operate different optical devices such as sensors, rangefinders, spectrometers, and isotopes identifiers. Among the innovative elements described in this paper, are a calibration-free, laser multi-gas sensor with range-finding option; a high signal/noise ratio transmittance spectrometer; a single-frequency laser with nano-selector; and low repetition-rate femtosecond fiber lasers operating in near- and middle- infrared spectral ranges. New detailed analyses of absorption spectroscopy theoretical approximations made it possible to achieve high-accuracy gas-concentration measurements with miniature optical sensors.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Communication: Stochastic evaluation of explicitly correlated second-order many-body perturbation energy

A stochastic algorithm is proposed that can compute the basis-set-incompleteness correction to the second-order many-body perturbation (MP2) energy of a polyatomic molecule. It evaluates the sum of two-, three-, and four-electron integrals over an explicit function of electron-electron distances by a Monte Carlo (MC) integration at an operation cost per MC step increasing only quadratically with size. The method can reproduce the corrections to the MP2/cc-pVTZ energies of H{sub 2}O, CH{sub 4}, and C{sub 6}H{sub 6} within a few mE{sub h} after several million MC steps. It circumvents the resolution-of-the-identity approximation to the nonfactorable three-electron integrals usually necessary in the conventional explicitly correlated (R12 or F12) methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simulation and optimization of pressure swing adsorption systmes using reduced-order modeling

Over the past three decades, pressure swing adsorption (PSA) processes have been widely used as energyefficient gas separation techniques, especially for high purity hydrogen purification from refinery gases. Models for PSA processes are multiple instances of partial differential equations (PDEs) in time and space with periodic boundary conditions that link the processing steps together. The solution of this coupled stiff PDE system is governed by steep fronts moving with time. As a result, the optimization of such systems represents a significant computational challenge to current differential algebraic equation (DAE) optimization techniques and nonlinear programming algorithms. Model reduction is one approach to generate cost-efficient low-order models which can be used as surrogate models in the optimization problems. This study develops a reducedorder model (ROM) based on proper orthogonal decomposition (POD), which is a low-dimensional approximation to a dynamic PDE-based model. The proposed method leads to a DAE system of significantly lower order, thus replacing the one obtained from spatial discretization and making the optimization problem computationally efficient. The method has been applied to the dynamic coupled PDE-based model of a twobed four-step PSA process for separation of hydrogen from methane. Separate ROMs have been developed for each operating step with different POD modes for each of them. A significant reduction in the order of the number of states has been achieved. The reduced-order model has been successfully used to maximize hydrogen recovery by manipulating operating pressures, step times and feed and regeneration velocities, while meeting product purity and tight bounds on these parameters. Current results indicate the proposed ROM methodology as a promising surrogate modeling technique for cost-effective optimization purposes.

08 HYDROGEN↗

Hybrid stochastic simulation of reaction-diffusion systems with slow and fast dynamics

In this paper, we present a novel hybrid method to simulate discrete stochastic reaction-diffusion models arising in biochemical signaling pathways. We study moderately stiff systems, for which we can partition each reaction or diffusion channel into either a slow or fast subset, based on its propensity. Numerical approaches missing this distinction are often limited with respect to computational run time or approximation quality. We design an approximate scheme that remedies these pitfalls by using a new blending strategy of the well-established inhomogeneous stochastic simulation algorithm and the tau-leaping simulation method. The advantages of our hybrid simulation algorithm are demonstrated on three benchmarking systems, with special focus on approximation accuracy and efficiency.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Hybrid framework for the simulation of stochastic chemical kinetics

Stochasticity plays a fundamental role in various biochemical processes, such as cell regulatory networks and enzyme cascades. Isothermal, well-mixed systems can be modelled as Markov processes, typically simulated using the Gillespie Stochastic Simulation Algorithm (SSA) [25]. While easy to implement and exact, the computational cost of using the Gillespie SSA to simulate such systems can become prohibitive as the frequency of reaction events increases. This has motivated numerous coarse-grained schemes, where the “fast” reactions are approximated either using Langevin dynamics or deterministically. While such approaches provide a good approximation when all reactants are abundant, the approximation breaks down when one or more species exist only in small concentrations and the fluctuations arising from the discrete nature of the reactions become significant. This is particularly problematic when using such methods to compute statistics of extinction times for chemical species, as well as simulating non-equilibrium systems such as cell-cycle models in which a single species can cycle between abundance and scarcity. In this paper, a hybrid jump-diffusion model for simulating well-mixed stochastic kinetics is derived. It acts as a bridge between the Gillespie SSA and the chemical Langevin equation. For low reactant reactions the underlying behaviour is purely discrete, while purely diffusive when the concentrations of all species are large, with the two different behaviours coexisting in the intermediate region. A bound on the weak error in the classical large volume scaling limit is obtained, and three different numerical discretisations of the jump-diffusion model are described. The benefits of such a formalism are illustrated using computational examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU-F-BRA-13: Knowledge-Based Treatment Planning for Prostate LDR Brachytherapy Based On Principle Component Analysis

Purpose: To create a knowledge-based algorithm for prostate LDR brachytherapy treatment planning that standardizes plan quality using seed arrangements tailored to individual physician preferences while being fast enough for real-time planning. Methods: A dataset of 130 prior cases was compiled for a physician with an active prostate seed implant practice. Ten cases were randomly selected to test the algorithm. Contours from the 120 library cases were registered to a common reference frame. Contour variations were characterized on a point by point basis using principle component analysis (PCA). A test case was converted to PCA vectors using the same process and then compared with each library case using a Mahalanobis distance to evaluate similarity. Rank order PCA scores were used to select the best-matched library case. The seed arrangement was extracted from the best-matched case and used as a starting point for planning the test case. Computational time was recorded. Any subsequent modifications were recorded that required input from a treatment planner to achieve an acceptable plan. Results: The computational time required to register contours from a test case and evaluate PCA similarity across the library was approximately 10s. Five of the ten test cases did not require any seed additions, deletions, or moves to obtain an acceptable plan. The remaining five test cases required on average 4.2 seed modifications. The time to complete manual plan modifications was less than 30s in all cases. Conclusion: A knowledge-based treatment planning algorithm was developed for prostate LDR brachytherapy based on principle component analysis. Initial results suggest that this approach can be used to quickly create treatment plans that require few if any modifications by the treatment planner. In general, test case plans have seed arrangements which are very similar to prior cases, and thus are inherently tailored to physician preferences.

60 APPLIED LIFE SCIENCES↗

Hybrid immersed interface-immersed boundary methods for AC dielectrophoresis

Dielectrophoresis, a nonlinear electrokinetic transport mechanism, has become popular in many engineering applications including manipulation, characterization and actuation of biomaterials, particles and biological cells. In this paper, we present a hybrid immersed interface–immersed boundary method to study AC dielectrophoresis where an algorithm is developed to solve the complex Poisson equation using a real variable formulation. An immersed interface method is employed to obtain the AC electric field in a fluid media with suspended particles and an immersed boundary method is used for the fluid equations and particle transport. The convergence of the proposed algorithm as well as validation of the hybrid scheme with experimental results is presented. In this paper, the Maxwell stress tensor is used to calculate the dielectrophoretic force acting on particles by considering the physical effect of particles in the computational domain. Thus, this study eliminates the approximations used in point dipole methods for calculating dielectrophoretic force. A comparative study between Maxwell stress tensor and point dipole methods for computing dielectrophoretic forces are presented. The hybrid method is used to investigate the physics of dielectrophoresis in microfluidic devices using an AC electric field. The numerical results show that with proper design and appropriate selection of applied potential and frequency, global electric field minima can be obtained to facilitate multiple particle trapping by exploiting the mechanism of negative dielectrophoresis. Our numerical results also show that electrically neutral particles form a chain parallel to the applied electric field irrespective of their initial orientation when an AC electric field is applied. This proposed hybrid numerical scheme will help to better understand dielectrophoresis and to design and optimize microfluidic devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Investigation of electron-atom/molecule scattering resonances: Two complex multiconfigurational self-consistent field approaches

Resonances are temporarily bound states which lie in the continuum part of the Hamiltonian. If the electronic coordinates of the Hamiltonian are scaled (“dilated”) by a complex parameter, η = αe{sup iθ} (α, θ real), then its complex eigenvalues represent the scattering states (resonant and non-resonant) while the eigenvalues corresponding to the bound states and the ionization and the excitation thresholds remain real and unmodified. These make the study of these transient species amenable to the bound state methods. We developed a quadratically convergent multiconfigurational self-consistent field method (MCSCF), a well-established bound-state technique, combined with a dilated Hamiltonian to investigate resonances. This is made possible by the adoption of a second quantization algebra suitable for a set of “complex conjugate biorthonormal” spin orbitals and a modified step-length constraining algorithm to control the walk on the complex energy hypersurface while searching for the stationary point using a multidimensional Newton-Raphson scheme. We present our computational results for the {sup 2}PBe{sup −} shape resonances using two different computationally efficient methods that utilize complex scaled MCSCF (i.e., CMCSCF). These two methods are to straightforwardly use CMCSCF energy differences and to obtain energy differences using an approximation to the complex multiconfigurational electron propagator. It is found that, differing from previous computational studies by others, there are actually two {sup 2}PBe{sup −} shape resonances very close in energy. In addition, N{sub 2} resonances are examined using one of these methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Two-particle correlations in a dynamic cluster approximation with continuous momentum dependence: Superconductivity in the two-dimensional Hubbard model

The DCA + algorithm was recently introduced by Stear, Maier, and Schulthess [Phys. Rev. B 88, 115101 (2013), 10.1103/PhysRevB.88.115101] to extend the dynamic cluster approximation (DCA) with a continuous lattice self-energy in order to achieve better convergence with cluster size. In this work, we extend the DCA + algorithm to the calculation of two-particle correlation functions by introducing irreducible vertex functions with continuous momentum dependence consistent with the DCA + self-energy. This enables a significantly more controlled and reliable study of phase transitions than with the DCA. We test the new method by calculating the superconducting transition temperature $T_c$ in the attractive Hubbard model and show that it reproduces previous determinantal quantum Monte Carlo results. We then calculate $T_c$ in the doped repulsive Hubbard model, for which previous DCA calculations could only access the weak-coupling ($\textit{U}$ =4$\textit{t}$) regime for large clusters. Here, we show that the new algorithm provides access to much larger clusters and delivers asymptotically converged results for $T_c$ for both the weak ($\textit{U}$ =4$\textit{t}$) and intermediate ($\textit{U}$ =7$\textit{t}$) coupling regimes, and thereby enables the accurate determination of the exact infinite cluster size result.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗