4 resultados para Automatic mesh generation

em CaltechTHESIS


Relevância:

20.00% 20.00%

Publicador:

Resumo:

A critical challenge for the 21st century is shifting from the predominant use of fossil fuels to renewables for energy. Among many options, sunlight is the only single renewable resource with sufficient abundance to replace most or all of our current fossil energy use. However, existing photovoltaic and solar thermal technologies cannot be scaled infinitely due to the temporal and geographic intermittency of sunlight. Therefore efficient and inexpensive methods for storage of solar energy in a dense medium are needed in order to greatly increase utilization of the sun as a primary resource. For this purpose we have proposed an artificial photosynthetic system consisting of semiconductors, electrocatalysts, and polymer membranes to carry out photoelectrochemical water splitting as a method for solar fuel generation.

This dissertation describes efforts over the last five years to develop critical semiconductor and catalyst components for efficient and scalable photoelectrochemical hydrogen evolution, one of the half reactions for water splitting. We identified and developed Ni–Mo alloy and Ni2P nanoparticles as promising earth-abundant electrocatalysts for hydrogen evolution. We thoroughly characterized Ni–Mo alloys alongside Ni and Pt catalysts deposited onto planar and structured Si light absorbers for solar hydrogen generation. We sought to address several key challenges that emerged in the use of non-noble catalysts for solar fuels generation, resulting in the synthesis and characterization of Ni–Mo nanopowder for use in a new photocathode device architecture. To address the mismatch in stability between non-noble metal alloys and Si absorbers, we also synthesized and characterized p-type WSe2 as a candidate light absorber alternative to Si that is stable under acidic and alkaline conditions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Moving mesh methods (also called r-adaptive methods) are space-adaptive strategies used for the numerical simulation of time-dependent partial differential equations. These methods keep the total number of mesh points fixed during the simulation, but redistribute them over time to follow the areas where a higher mesh point density is required. There are a very limited number of moving mesh methods designed for solving field-theoretic partial differential equations, and the numerical analysis of the resulting schemes is challenging. In this thesis we present two ways to construct r-adaptive variational and multisymplectic integrators for (1+1)-dimensional Lagrangian field theories. The first method uses a variational discretization of the physical equations and the mesh equations are then coupled in a way typical of the existing r-adaptive schemes. The second method treats the mesh points as pseudo-particles and incorporates their dynamics directly into the variational principle. A user-specified adaptation strategy is then enforced through Lagrange multipliers as a constraint on the dynamics of both the physical field and the mesh points. We discuss the advantages and limitations of our methods. The proposed methods are readily applicable to (weakly) non-degenerate field theories---numerical results for the Sine-Gordon equation are presented.

In an attempt to extend our approach to degenerate field theories, in the last part of this thesis we construct higher-order variational integrators for a class of degenerate systems described by Lagrangians that are linear in velocities. We analyze the geometry underlying such systems and develop the appropriate theory for variational integration. Our main observation is that the evolution takes place on the primary constraint and the 'Hamiltonian' equations of motion can be formulated as an index 1 differential-algebraic system. We then proceed to construct variational Runge-Kutta methods and analyze their properties. The general properties of Runge-Kutta methods depend on the 'velocity' part of the Lagrangian. If the 'velocity' part is also linear in the position coordinate, then we show that non-partitioned variational Runge-Kutta methods are equivalent to integration of the corresponding first-order Euler-Lagrange equations, which have the form of a Poisson system with a constant structure matrix, and the classical properties of the Runge-Kutta method are retained. If the 'velocity' part is nonlinear in the position coordinate, we observe a reduction of the order of convergence, which is typical of numerical integration of DAEs. We also apply our methods to several models and present the results of our numerical experiments.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This study proposes a wastewater electrolysis cell (WEC) for on-site treatment of human waste coupled with decentralized molecular H2 production. The core of the WEC includes mixed metal oxides anodes functionalized with bismuth doped TiO2 (BiOx/TiO2). The BiOx/TiO2 anode shows reliable electro-catalytic activity to oxidize Cl- to reactive chlorine species (RCS), which degrades environmental pollutants including chemical oxygen demand (COD), protein, NH4+, urea, and total coliforms. The WEC experiments for treatment of various kinds of synthetic and real wastewater demonstrate sufficient water quality of effluent for reuse for toilet flushing and environmental purposes. Cathodic reduction of water and proton on stainless steel cathodes produced molecular H2 with moderate levels of current and energy efficiency. This thesis presents a comprehensive environmental analysis together with kinetic models to provide an in-depth understanding of reaction pathways mediated by the RCS and the effects of key operating parameters. The latter part of this thesis is dedicated to bilayer hetero-junction anodes which show enhanced generation efficiency of RCS and long-term stability.

Chapter 2 describes the reaction pathway and kinetics of urea degradation mediated by electrochemically generated RCS. The urea oxidation involves chloramines and chlorinated urea as reaction intermediates, for which the mass/charge balance analysis reveals that N2 and CO2 are the primary products. Chapter 3 investigates direct-current and photovoltaic powered WEC for domestic wastewater treatment, while Chapter 4 demonstrates the feasibility of the WEC to treat model septic tank effluents. The results in Chapter 2 and 3 corroborate the active roles of chlorine radicals (Cl•/Cl2-•) based on iR-compensated anodic potential (thermodynamic basis) and enhanced pseudo-first-order rate constants (kinetic basis). The effects of operating parameters (anodic potential and [Cl-] in Chapter 3; influent dilution and anaerobic pretreatment in Chapter 4) on the rate and current/energy efficiency of pollutants degradation and H2 production are thoroughly discussed based on robust kinetic models. Chapter 5 reports the generation of RCS on Ir0.7Ta0.3Oy/BixTi1-xOz hetero-junction anodes with enhanced rate, current efficiency, and long-term stability compared to the Ir0.7Ta0.3Oy anode. The effects of surficial Bi concentration are interrogated, focusing on relative distributions between surface-bound hydroxyl radical and higher oxide.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The current power grid is on the cusp of modernization due to the emergence of distributed generation and controllable loads, as well as renewable energy. On one hand, distributed and renewable generation is volatile and difficult to dispatch. On the other hand, controllable loads provide significant potential for compensating for the uncertainties. In a future grid where there are thousands or millions of controllable loads and a large portion of the generation comes from volatile sources like wind and solar, distributed control that shifts or reduces the power consumption of electric loads in a reliable and economic way would be highly valuable.

Load control needs to be conducted with network awareness. Otherwise, voltage violations and overloading of circuit devices are likely. To model these effects, network power flows and voltages have to be considered explicitly. However, the physical laws that determine power flows and voltages are nonlinear. Furthermore, while distributed generation and controllable loads are mostly located in distribution networks that are multiphase and radial, most of the power flow studies focus on single-phase networks.

This thesis focuses on distributed load control in multiphase radial distribution networks. In particular, we first study distributed load control without considering network constraints, and then consider network-aware distributed load control.

Distributed implementation of load control is the main challenge if network constraints can be ignored. In this case, we first ignore the uncertainties in renewable generation and load arrivals, and propose a distributed load control algorithm, Algorithm 1, that optimally schedules the deferrable loads to shape the net electricity demand. Deferrable loads refer to loads whose total energy consumption is fixed, but energy usage can be shifted over time in response to network conditions. Algorithm 1 is a distributed gradient decent algorithm, and empirically converges to optimal deferrable load schedules within 15 iterations.

We then extend Algorithm 1 to a real-time setup where deferrable loads arrive over time, and only imprecise predictions about future renewable generation and load are available at the time of decision making. The real-time algorithm Algorithm 2 is based on model-predictive control: Algorithm 2 uses updated predictions on renewable generation as the true values, and computes a pseudo load to simulate future deferrable load. The pseudo load consumes 0 power at the current time step, and its total energy consumption equals the expectation of future deferrable load total energy request.

Network constraints, e.g., transformer loading constraints and voltage regulation constraints, bring significant challenge to the load control problem since power flows and voltages are governed by nonlinear physical laws. Remarkably, distribution networks are usually multiphase and radial. Two approaches are explored to overcome this challenge: one based on convex relaxation and the other that seeks a locally optimal load schedule.

To explore the convex relaxation approach, a novel but equivalent power flow model, the branch flow model, is developed, and a semidefinite programming relaxation, called BFM-SDP, is obtained using the branch flow model. BFM-SDP is mathematically equivalent to a standard convex relaxation proposed in the literature, but numerically is much more stable. Empirical studies show that BFM-SDP is numerically exact for the IEEE 13-, 34-, 37-, 123-bus networks and a real-world 2065-bus network, while the standard convex relaxation is numerically exact for only two of these networks.

Theoretical guarantees on the exactness of convex relaxations are provided for two types of networks: single-phase radial alternative-current (AC) networks, and single-phase mesh direct-current (DC) networks. In particular, for single-phase radial AC networks, we prove that a second-order cone program (SOCP) relaxation is exact if voltage upper bounds are not binding; we also modify the optimal load control problem so that its SOCP relaxation is always exact. For single-phase mesh DC networks, we prove that an SOCP relaxation is exact if 1) voltage upper bounds are not binding, or 2) voltage upper bounds are uniform and power injection lower bounds are strictly negative; we also modify the optimal load control problem so that its SOCP relaxation is always exact.

To seek a locally optimal load schedule, a distributed gradient-decent algorithm, Algorithm 9, is proposed. The suboptimality gap of the algorithm is rigorously characterized and close to 0 for practical networks. Furthermore, unlike the convex relaxation approach, Algorithm 9 ensures a feasible solution. The gradients used in Algorithm 9 are estimated based on a linear approximation of the power flow, which is derived with the following assumptions: 1) line losses are negligible; and 2) voltages are reasonably balanced. Both assumptions are satisfied in practical distribution networks. Empirical results show that Algorithm 9 obtains 70+ times speed up over the convex relaxation approach, at the cost of a suboptimality within numerical precision.