Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2310.03260

Application Potential of a Hybrid Ground Source Heat Pump Array for the UC Berkeley Campus Business and Law Node Energy System: A Preliminary Study

Kecheng Chen·Kenichi Soga·Patrick Dobson·Peter Nico
View original source ↗Read source document ↗Export metadata ↓

Abstract

The current plan divides the UC Berkeley (UCB) campus energy system into five nodes, where the Business and Law node was studied because of an open field site for borehole installation. The Pacific Northwest National Laboratory's Commercial Prototype Building Models were used to estimate heating and cooling load requirements for UCB campus building types by considering model characteristics (for example, high base load from hospitals, high DHW in hotels) corresponding to the ASHRAE Standard 90.1-2013. Unscaled load profiles were created from the EnergyPlus building energy simulation and scaled with monitored peak load and annual energy use to generate the target node's hourly heating and cooling load profiles. An optimization problem was solved to design a hybrid GSHP system, where the objective function is the lifetime total cost of the system, and the optimization variables are the portion of heating and cooling loads covered by the GSHP system. Modelica models for air source and ground source heat pump systems were built for detailed case studies based on optimization results. In the Modelica model, the demand side is connected to the radiators in the building to transfer heat, and the source side is connected to GSHP, ASHP, or other heating and cooling facilities. The results demonstrate that an appropriate hybrid GSHP system can help reduce both borehole numbers and electricity consumption for the UCB campus site.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kecheng Chen, Kenichi Soga, Patrick Dobson, Peter Nico. 2023-10-05. Application Potential of a Hybrid Ground Source Heat Pump Array for the UC Berkeley Campus Business and Law Node Energy System: A Preliminary Study. https://arxiv.org/abs/2310.03260

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA↗
arXiv2026

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA↗
arXiv2026

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA↗