{'fraction_non_alphanumeric': 0.03096774193548387, 'fraction_numerical': 0.015483870967741935, 'mean_word_length': 5.632478632478633, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Heuristic Algorithm for the Heath–Jarrow–Morton Model

Heath–Jarrow–Morton [1990, 1991, and 1992] presented a general, intuitively appealing, term structure model for pricing interest rate claims. However, in discrete time, the model results in a non-recombining tree for many general deterministic volatility structures, which can be relatively computationally expensive when the number of time steps is large. This article provides a technique that combines interpolation with sparse ad-hoc mesh generation for valuing interest rate claims in the Heath–Jarrow–Morton framework. When this approach is used, the number of nodes in the mesh is significantly reduced without sacrificing accuracy. This article shows that with proper choice of nodes, the method will converge.